Sciweavers

5 search results - page 1 / 1
» Mining relaxed closed subspace clusters
Sort
View
ACMSE
2010
ACM
13 years 2 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang
PVLDB
2010
86views more  PVLDB 2010»
13 years 3 months ago
Swarm: Mining Relaxed Temporal Moving Object Clusters
Recent improvements in positioning technology make massive moving object data widely available. One important analysis is to find the moving objects that travel together. Existin...
Zhenhui Li, Bolin Ding, Jiawei Han, Roland Kays
ICDM
2009
IEEE
169views Data Mining» more  ICDM 2009»
13 years 2 months ago
Learning the Shared Subspace for Multi-task Clustering and Transductive Transfer Classification
There are many clustering tasks which are closely related in the real world, e.g. clustering the web pages of different universities. However, existing clustering approaches neglec...
Quanquan Gu, Jie Zhou
GIS
2002
ACM
13 years 4 months ago
Opening the black box: interactive hierarchical clustering for multivariate spatial patterns
Clustering is one of the most important tasks for geographic knowledge discovery. However, existing clustering methods have two severe drawbacks for this purpose. First, spatial c...
Diansheng Guo, Donna Peuquet, Mark Gahegan
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
13 years 2 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König