Sciweavers

255 search results - page 5 / 51
» Data Clustering with a Relational Push-Pull Model
Sort
View
62
Voted
ACL
1993
14 years 11 months ago
Distributional Clustering of English Words
We describe and evaluate experimentally a method for clustering words according to their distribution in particular syntactic contexts. Words are represented by the relative frequ...
Fernando C. N. Pereira, Naftali Tishby, Lillian Le...
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
15 years 10 months ago
Cluster-based concept invention for statistical relational learning
We use clustering to derive new relations which augment database schema used in automatic generation of predictive features in statistical relational learning. Clustering improves...
Alexandrin Popescul, Lyle H. Ungar
AAAI
2006
14 years 11 months ago
Learning Systems of Concepts with an Infinite Relational Model
Relationships between concepts account for a large proportion of semantic knowledge. We present a nonparametric Bayesian model that discovers systems of related concepts. Given da...
Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griff...
CIKM
2008
Springer
14 years 11 months ago
Scalable community discovery on textual data with relations
Every piece of textual data is generated as a method to convey its authors' opinion regarding specific topics. Authors deliberately organize their writings and create links, ...
Huajing Li, Zaiqing Nie, Wang-Chien Lee, C. Lee Gi...
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
15 years 10 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui