Sciweavers

8294 search results - page 1068 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
TIP
2010
182views more  TIP 2010»
15 years 1 months ago
Flexible Manifold Embedding: A Framework for Semi-Supervised and Unsupervised Dimension Reduction
We propose a unified manifold learning framework for semi-supervised and unsupervised dimension reduction by employing a simple but effective linear regression function to map the ...
Feiping Nie, Dong Xu, Ivor Wai-Hung Tsang, Changsh...
VLDB
1998
ACM
147views Database» more  VLDB 1998»
15 years 11 months ago
Scalable Techniques for Mining Causal Structures
Mining for association rules in market basket data has proved a fruitful areaof research. Measures such as conditional probability (confidence) and correlation have been used to i...
Craig Silverstein, Sergey Brin, Rajeev Motwani, Je...
ICML
2005
IEEE
16 years 8 months ago
Ensembles of biased classifiers
We propose a novel ensemble learning algorithm called Triskel, which has two interesting features. First, Triskel learns an ensemble of classifiers, each biased to have high preci...
Andreas Heß, Nicholas Kushmerick, Rinat Khou...
GRID
2004
Springer
16 years 18 days ago
Design and Analysis of a Dynamic Scheduling Strategy with Resource Estimation for Large-Scale Grid Systems
In this paper, we present a resource conscious dynamic scheduling strategy for handling large volume computationally intensive loads in a Grid system involving multiple sources an...
Sivakumar Viswanathan, Bharadwaj Veeravalli, Danto...
« Prev « First page 1068 / 1659 Last » Next »