Sciweavers

4591 search results - page 579 / 919
» Learning from Dyadic Data
Sort
View
CVPR
2010
IEEE
15 years 4 months ago
Multi-structure model selection via kernel optimisation
Our goal is to fit the multiple instances (or structures) of a generic model existing in data. Here we propose a novel model selection scheme to estimate the number of genuine str...
Tat-Jun Chin, David Suter, Hanzi Wang
KDD
2006
ACM
118views Data Mining» more  KDD 2006»
16 years 6 months ago
Reducing the human overhead in text categorization
Many applications in text processing require significant human effort for either labeling large document collections (when learning statistical models) or extrapolating rules from...
Arnd Christian König, Eric Brill
164
Voted
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
16 years 6 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
16 years 6 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
16 years 9 days ago
Automatic Construction of N-ary Tree Based Taxonomies
Hierarchies are an intuitive and effective organization paradigm for data. Of late there has been considerable research on automatically learning hierarchical organizations of dat...
Kunal Punera, Suju Rajan, Joydeep Ghosh