Department of Computer Science and Engineering
Persistent link for this community
Browse
Browsing Department of Computer Science and Engineering by Author "Agovic, Amrudin"
Now showing 1 - 4 of 4
Results Per Page
Sort Options
Item A Unified View of Graph-based Semi-Supervised Learning: Label Propagation, Graph-Cuts, and Embeddings(2009-05-12) Agovic, Amrudin; Banerjee, ArindamRecent years have seen a growing number of graph-based semi-supervised learning methods. While the literature currently contains several of these methods, their relationships with one another and with other graph-based data analysis algorithms remain unclear. In this paper, we present a unified view of graph-based semi-supervised learning. Our framework unifies three important and seemingly unrelated approaches to semi-supervised learning, viz label propagation, graph cuts and manifold embeddings. We show that most existing label propagation methods solve a special case of a generalized label propagation (GLP) formulation which is a constrained quadratic program involving a graph Laplacian. Different methods arise simply based on the choice of the Laplacian and the nature of the constraints. Further, we show that semi-supervised graph-cut problems can also be viewed and solved as special cases of the GLP formulation. In addition, we show that semi-supervised non-linear manifold embedding methods also solve variants of the GLP problem and propose a novel family of semi-supervised algorithms based on existing embedding methods. Finally, we present comprehensive empirical performance evaluation of the existing label propagation methods as well as the new ones derived from manifold embedding. The new family of embedding based label propagation methods are found to be competitive on several datasets.Item Component-based design for a trading agent(2004-05-04) Collins, John; Agovic, Amrudin; Damer, Steven; Gini, MariaMinneTAC is an agent designed to compete in the Supply-Chain Trading Agent Competition. It is also designed to support the needs of a group of researchers, each of whom is interested in different decision problems related to the competition scenario. The design of MinneTAC breaks out each basic behavior into a separate, configurable component. Dependencies between components are almost non-existent. The agent itself is defined as a set of "roles", and a working agent is one for which a component is supplied for each role. This allows each user to focus on a single problem and work independently, and it allows multiple user to tackle the same problem in different ways. A working MinneTAC agent is completely defined by a set of configuration files that map the desired roles to the code that implements them, and that set parameters for the components. This paper describes the design of MinneTAC and evaluates its effectiveness in support of our research agenda, and in its competitiveness in the TAC-SCM game environment.Item Design and Analysis of the MinneTAC-03 Supply-Chain Trading Agent(2004-04-26) Ketter, Wolfgang; Kryzhnyaya, Elena; Damer, Steven; McMillen, Colin; Agovic, Amrudin; Collins, John; Gini, MariaMinneTAC is an agent designed to compete in the Supply-Chain Trading Agent Competition. It is also designed to support the needs of a group of researchers, each of whom is interested in different decision problems related to the competition scenario. The design of MinneTAC breaks outeach basic behavior into a separate, configurable component. Dependencies between components are almost non-existent. This design allows each user to focus on a single problem and work independently, and it allows multiple user to tackle the same problem in different ways. This paper describes the design of MinneTAC and evaluates its effectiveness in support of our research agenda, and in its competitiveness in the TAC-SCM game environment. We also describe two sales strategies used by MinneTAC. Both strategies estimate, as the game progresses, the probability of receiving a customer order for different prices and compute the expected profit. Offers are made to maximize the expected profit on each order. The maindifference between the two strategies is in how the probability of receiving an order and the offer prices are computed. The first strategy works well in high-demand games, the second was developed to improve performance in low-demand games. We empirically analyze the effect of the discount given by suppliers on orders received the firstday of the game, and we show that in high-demand games there is a strong correlation between the offers an agent receives from suppliers on the first day of the game and the agent's performance in the game.Item Software architecture of the MinneTAC supply-chain trading agent(2008-10-20) Collins, John; Ketter, Wolfgang; Gini, Maria; Agovic, AmrudinThe MinneTAC trading agent is designed to compete in the Supply-Chain Trading Agent Competition. It is also designed to support the needs of a group of researchers, each of whom is interested in different decision problems related to the competition scenario. The design of MinneTAC breaks out each basic behavior into a separate, configurable component, and allows dynamic construction of analysis and modeling tools from small, single-purpose "evaluators". The agent is defined as a set of "roles", and a working agent is one for which a component is supplied for each role. This allows each researcher to focus on a single problem and work independently, and it allows multiple researchers to tackle the same problem in different ways. A working MinneTAC agent is completely defined by a set of configuration files that map the desired roles to the code that implements them, and that set parameters for the components. We describe the design of MinneTAC, and we evaluate its effectiveness in support of our research agenda and its competitiveness in the TAC-SCM game environment.