Sciweavers

2034 search results - page 35 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
IJCNN
2007
IEEE
14 years 2 months ago
Iterative Feature Selection in Gaussian Mixture Clustering with Automatic Model Selection
— This paper proposes an algorithm to deal with the feature selection in Gaussian mixture clustering by an iterative way: the algorithm iterates between the clustering and the un...
Hong Zeng, Yiu-ming Cheung
ESEM
2007
ACM
13 years 11 months ago
Using Context Distance Measurement to Analyze Results across Studies
Providing robust decision support for software engineering (SE) requires the collection of data across multiple contexts so that one can begin to elicit the context variables that...
Daniela Cruzes, Victor R. Basili, Forrest Shull, M...
KDD
2002
ACM
1075views Data Mining» more  KDD 2002»
14 years 8 months ago
CLOPE: a fast and effective clustering algorithm for transactional data
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic m...
Yiling Yang, Xudong Guan, Jinyuan You
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 9 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller