Sciweavers

804 search results - page 3 / 161
» Experiments on Union-Find Algorithms for the Disjoint-Set Da...
Sort
View
JMLR
2012
11 years 10 months ago
Transductive Learning of Structural SVMs via Prior Knowledge Constraints
Reducing the number of labeled examples required to learn accurate prediction models is an important problem in structured output prediction. In this paper we propose a new transd...
Chun-Nam Yu
JMLR
2010
157views more  JMLR 2010»
13 years 2 months ago
Combining Experiments to Discover Linear Cyclic Models with Latent Variables
We present an algorithm to infer causal relations between a set of measured variables on the basis of experiments on these variables. The algorithm assumes that the causal relatio...
Frederick Eberhardt, Patrik O. Hoyer, Richard Sche...
EUROPAR
2001
Springer
14 years 3 days ago
Experiments in Parallel Clustering with DBSCAN
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a...
Domenica Arlia, Massimo Coppola
AAAI
2008
13 years 10 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 years 9 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan