Sciweavers

255 search results - page 2 / 51
» Data Clustering with a Relational Push-Pull Model
Sort
View
IJCAI
2001
13 years 7 months ago
Probabilistic Classification and Clustering in Relational Data
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
Benjamin Taskar, Eran Segal, Daphne Koller
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
14 years 5 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 6 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 6 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
NIPS
2004
13 years 7 months ago
Sharing Clusters among Related Groups: Hierarchical Dirichlet Processes
We propose the hierarchical Dirichlet process (HDP), a nonparametric Bayesian model for clustering problems involving multiple groups of data. Each group of data is modeled with a...
Yee Whye Teh, Michael I. Jordan, Matthew J. Beal, ...