Sciweavers

1576 search results - page 164 / 316
» Streaming Algorithms for Independent Sets
Sort
View
ICAI
2004
15 years 7 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 7 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
PRL
2006
121views more  PRL 2006»
15 years 6 months ago
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Data reduction plays an important role in machine learning and pattern recognition with a high-dimensional data. In real-world applications data usually exists with hybrid formats...
Qinghua Hu, Daren Yu, Zongxia Xie
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
15 years 10 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham
PVLDB
2008
107views more  PVLDB 2008»
15 years 4 months ago
Constrained locally weighted clustering
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
Hao Cheng, Kien A. Hua, Khanh Vu