Results 1  10
of
2,151
An e cient algorithm for the stable roommates problem
 Journal of Algorithms
, 1985
"... The stable marriage problem is that of matching n men and n women, each of whom has ranked the members of the opposite sex in order of preference, so that no unmatched couple both prefer each other to their partners under the matching. At least one stable matching exists for every stable marriage i ..."
Abstract

Cited by 88 (5 self)
 Add to MetaCart
instance, and efficient algorithms for finding such a matching are well known. The stable roommates problem involves a single set of even cardinality n , each member of which ranks all the others in order of preference. A stable matching is now a partition of this single set into n/2 pairs so that no two
An efficient algorithm for mining association rules in large databases
, 1995
"... Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an efficient algorithm for mining association rules that is fundamentally different from known algorithms. Compared to previous ..."
Abstract

Cited by 437 (0 self)
 Add to MetaCart
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an efficient algorithm for mining association rules that is fundamentally different from known algorithms. Compared
Toward optimal feature selection
 In 13th International Conference on Machine Learning
, 1995
"... In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intractable, method for feature subset selection is presented. We show that our goal should be to eliminate a feature if it g ..."
Abstract

Cited by 480 (9 self)
 Add to MetaCart
if it gives us little or no additional information beyond that subsumed by the remaining features. In particular, this will be the case for both irrelevant and redundant features. We then give an e cient algorithm for feature selection which computes an approximation to the optimal feature selection criterion
Nearest neighbor queries.
 ACM SIGMOD Record,
, 1995
"... Abstract A frequently encountered type of query in Geographic Information Systems is to nd the k nearest neighbor objects to a given point in space. Processing such queries requires substantially di erent search algorithms than those for location or range queries. In this paper we present a n e cie ..."
Abstract

Cited by 592 (1 self)
 Add to MetaCart
cient branchandbound Rtree traversal algorithm to nd the nearest neighbor object to a point, and then generalize it to nding the k nearest neighbors. We also discuss metrics for an optimistic and a pessimistic search ordering strategy as well as for pruning. Finally, w e present the results
Combining labeled and unlabeled data with cotraining
, 1998
"... We consider the problem of using a large unlabeled sample to boost performance of a learning algorithm when only a small set of labeled examples is available. In particular, we consider a setting in which the description of each example can be partitioned into two distinct views, motivated by the ta ..."
Abstract

Cited by 1633 (28 self)
 Add to MetaCart
We consider the problem of using a large unlabeled sample to boost performance of a learning algorithm when only a small set of labeled examples is available. In particular, we consider a setting in which the description of each example can be partitioned into two distinct views, motivated
The activationrelaxation technique: An e#cient algorithm for sampling energy landscapes
 Computational Material Science
, 2001
"... Abstract Activated processes, i.e., rare events requiring thermal¯uctuations many times larger than the average thermal energy, play a central role in controlling the relaxation and diusion mechanisms of disordered materials such as amorphous and glassy solids, polymers and biomolecules. As the ti ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract Activated processes, i.e., rare events requiring thermal¯uctuations many times larger than the average thermal energy, play a central role in controlling the relaxation and diusion mechanisms of disordered materials such as amorphous and glassy solids, polymers and biomolecules. As the time scales involved are much longer than those associated with thermal vibrations, these processes cannot be studied eciently with standard realspace methods such as molecular dynamics (MD). They can be investigated much more eciently by working in the potential energy space. Instead of de®ning moves in terms of atomic displacements, the activation±relaxation technique (ART) follows paths directly in the energy landscape, from local minima to adjacent saddle points, giving full freedom for the system to create events of any complexity. In this paper, we review the technique in detail and present some recent applications to amorphous semiconductors and glasses. Ó
Prioritized sweeping: Reinforcement learning with less data and less time
 Machine Learning
, 1993
"... We present a new algorithm, Prioritized Sweeping, for e cient prediction and control of stochastic Markov systems. Incremental learning methods such asTemporal Di erencing and Qlearning have fast real time performance. Classical methods are slower, but more accurate, because they make full use of ..."
Abstract

Cited by 378 (6 self)
 Add to MetaCart
We present a new algorithm, Prioritized Sweeping, for e cient prediction and control of stochastic Markov systems. Incremental learning methods such asTemporal Di erencing and Qlearning have fast real time performance. Classical methods are slower, but more accurate, because they make full use
Proportionate progress: A notion of fairness in resource allocation
 Algorithmica
, 1996
"... Given a set of n tasks and m resources, where each task x has a rational weight x:w = x:e=x:p; 0 < x:w < 1, a periodic schedule is one that allocates a resource to a task x for exactly x:e time units in each interval [x:p k; x:p (k + 1)) for all k 2 N. We de ne a notion of proportionate progre ..."
Abstract

Cited by 322 (25 self)
 Add to MetaCart
progress, called Pfairness, and use it to design an e cient algorithm which solves the periodic scheduling problem. Keywords: Euclid's algorithm, fairness, network ow, periodic scheduling, resource allocation.
1E±cient Algorithms for 1 and 2echelon Web Proxy Location Problems
"... With the increasing popularity of the World Wide Web (Web), it is very di±cult for a single popular Web server to handle the explosive demand from its clients. Web caching (proxy) is an e®ective technique to reduce a Web server's load, alleviate Internet tra±c, and reduce user's response t ..."
Abstract
 Add to MetaCart
given level of demand. The location problem is known to be NPhard for general network topologies. We present O(n2) time algorithms which computes optimal proxy locations for the ring topology for singleechelon location problem. We present an O(k2l kgn 2) time algorithm for the linear topology
Sparse Principal Component Analysis
 Journal of Computational and Graphical Statistics
, 2004
"... Principal component analysis (PCA) is widely used in data processing and dimensionality reduction. However, PCA su#ers from the fact that each principal component is a linear combination of all the original variables, thus it is often di#cult to interpret the results. We introduce a new method ca ..."
Abstract

Cited by 279 (6 self)
 Add to MetaCart
on the regression coe#cients. E#cient algorithms are proposed to realize SPCA for both regular multivariate data and gene expression arrays. We also give a new formula to compute the total variance of modified principal components. As illustrations, SPCA is applied to real and simulated data, and the results
Results 1  10
of
2,151