Sciweavers

610 search results - page 1 / 122
» A Novel Framework for Discovering Robust Cluster Results
Sort
View
DIS
2006
Springer
13 years 11 months ago
A Novel Framework for Discovering Robust Cluster Results
We propose a novel method, called heterogeneous clustering ensemble (HCE), to generate robust clustering results that combine multiple partitions (clusters) derived from various cl...
Hye-Sung Yoon, Sang-Ho Lee, Sung-Bum Cho, Ju Han K...
SIGMOD
2008
ACM
131views Database» more  SIGMOD 2008»
14 years 7 months ago
Discovering topical structures of databases
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
Wensheng Wu, Berthold Reinwald, Yannis Sismanis, R...
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 26 days ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
14 years 8 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
IJIS
2007
155views more  IJIS 2007»
13 years 7 months ago
Clustering web search results using fuzzy ants
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
Steven Schockaert, Martine De Cock, Chris Cornelis...