Sciweavers

105 search results - page 8 / 21
» Why so many clustering algorithms: a position paper
Sort
View
WG
2005
Springer
15 years 3 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
INFOVIS
1998
IEEE
15 years 2 months ago
Similarity Clustering of Dimensions for an Enhanced Visualization of Multidimensional Data
The order and arrangement of dimensions (variates) is crucial for the effectiveness of a large number of visualization techniques such as parallel coordinates, scatterplots, recur...
Mihael Ankerst, Stefan Berchtold, Daniel A. Keim
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
15 years 3 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
ICSM
2005
IEEE
15 years 3 months ago
Co-Change Visualization
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
Dirk Beyer
IEEEVAST
2010
14 years 4 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...