Sciweavers

1971 search results - page 81 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
ICDE
2005
IEEE
132views Database» more  ICDE 2005»
14 years 1 months ago
CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
Mohammed Javeed Zaki, Markus Peters
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
14 years 8 months ago
Querying Multi-dimensional Data Indexed Using the Hilbert Space-filling Curve
Mapping to one-dimensional values and then using a onedimensional indexing method has been proposed as a way of indexing multi-dimensional data. Most previous related work uses th...
Jonathan K. Lawder, Peter J. H. King
ICPR
2002
IEEE
14 years 9 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
ICCV
2005
IEEE
14 years 9 months ago
Robust Path-Based Spectral Clustering with Application to Image Segmentation
Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. ...
Hong Chang, Dit-Yan Yeung
ICDAR
2011
IEEE
12 years 7 months ago
Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
Vasant Manohar, Shiv Naga Prasad Vitaladevuni, Hua...