Sciweavers

NIPS
2008
13 years 6 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas
IJCAI
2007
13 years 6 months ago
Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...
Shehroz S. Khan, Shri Kant
EMNLP
2007
13 years 6 months ago
V-Measure: A Conditional Entropy-Based External Cluster Evaluation Measure
We present V-measure, an external entropybased cluster evaluation measure. Vmeasure provides an elegant solution to many problems that affect previously defined cluster evaluatio...
Andrew Rosenberg, Julia Hirschberg
DMIN
2008
152views Data Mining» more  DMIN 2008»
13 years 6 months ago
PCS: An Efficient Clustering Method for High-Dimensional Data
Clustering algorithms play an important role in data analysis and information retrieval. How to obtain a clustering for a large set of highdimensional data suitable for database ap...
Wei Li 0011, Cindy Chen, Jie Wang
DAGSTUHL
2007
13 years 6 months ago
Multi-Aspect Tagging for Collaborative Structuring
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
Katharina Morik, Michael Wurst
CIMCA
2008
IEEE
13 years 6 months ago
A Clustering Algorithm Incorporating Density and Direction
This paper analyses the advantages and disadvantages of the K-means algorithm and the DENCLUE algorithm. In order to realise the automation of clustering analysis and eliminate hu...
Yu-Chen Song, Michael J. O'Grady, Gregory M. P. O'...
FLAIRS
2007
13 years 6 months ago
Improving Cluster Method Quality by Validity Indices
Clustering attempts to discover significant groups present in a data set. It is an unsupervised process. It is difficult to define when a clustering result is acceptable. Thus,...
Narjes Hachani, Habib Ounelli
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
13 years 7 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
HIPC
2000
Springer
13 years 8 months ago
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
DIS
2006
Springer
13 years 8 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann