Sciweavers

484 search results - page 9 / 97
» Measuring the Quality of Approximated Clusterings
Sort
View
EMMCVPR
1997
Springer
15 years 3 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
15 years 5 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
EDBT
2004
ACM
192views Database» more  EDBT 2004»
15 years 11 months ago
LIMBO: Scalable Clustering of Categorical Data
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
Periklis Andritsos, Panayiotis Tsaparas, Ren&eacut...
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
16 years 1 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu
DASFAA
2007
IEEE
240views Database» more  DASFAA 2007»
15 years 6 months ago
A Comparative Study of Ontology Based Term Similarity Measures on PubMed Document Clustering
Recent research shows that ontology as background knowledge can improve document clustering quality with its concept hierarchy knowledge. Previous studies take term semantic simila...
Xiaodan Zhang, Liping Jing, Xiaohua Hu, Michael K....