Sciweavers

Share
KDD
2012
ACM
281views Data Mining» more  KDD 2012»
7 years 1 months ago
Active spectral clustering via iterative uncertainty reduction
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
Fabian L. Wauthier, Nebojsa Jojic, Michael I. Jord...
ICML
2010
IEEE
8 years 10 months ago
Multiple Non-Redundant Spectral Clustering Views
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
Donglin Niu, Jennifer G. Dy, Michael I. Jordan
CORIA
2008
9 years 25 days ago
Involving Validity Indices in Document Clustering
The goal of any clustering algorithm is to find the optimal clustering solution with the optimal number of clusters. In order to evaluate a clustering solution, a number of validit...
Ahmad El Sayed, Hakim Hacid, Djamel A. Zighed
HPCC
2007
Springer
9 years 5 months ago
Maximum-Objective-Trust Clustering Solution and Analysis in Mobile Ad Hoc Networks
In mobile-AdHoc networks (MANETs), many applications need the support of layer-structure. Clustering solution is the most widely used layerstructure and the choosing of clusterhead...
Qiang Zhang, Guangming Hu, Zhenghu Gong
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
9 years 6 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios
books