Sciweavers

2065 search results - page 74 / 413
» Techniques of Cluster Algorithms in Data Mining
Sort
View
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 2 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
IPPS
2006
IEEE
15 years 7 months ago
Design and analysis of a multi-dimensional data sampling service for large scale data analysis applications
Sampling is a widely used technique to increase efficiency in database and data mining applications operating on large dataset. In this paper we present a scalable sampling imple...
Xi Zhang, Tahsin M. Kurç, Joel H. Saltz, Sr...
ICTAI
2006
IEEE
15 years 7 months ago
On the Relationships between Clustering and Spatial Co-location Pattern Mining
The goal of spatial co-location pattern mining is to find subsets of spatial features frequently located together in spatial proximity. Example co-location patterns include servi...
Yan Huang, Pusheng Zhang
120
Voted
ICDM
2009
IEEE
175views Data Mining» more  ICDM 2009»
14 years 11 months ago
Maximum Margin Clustering with Multivariate Loss Function
This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clust...
Bin Zhao, James Tin-Yau Kwok, Changshui Zhang
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 2 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis