Sciweavers

5624 search results - page 1027 / 1125
» On Conditional Covering Problem
Sort
View
KDD
2009
ACM
194views Data Mining» more  KDD 2009»
14 years 10 months ago
Combining link and content for community detection: a discriminative approach
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
Tianbao Yang, Rong Jin, Yun Chi, Shenghuo Zhu
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 10 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 10 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 10 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
14 years 10 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
« Prev « First page 1027 / 1125 Last » Next »