Sciweavers

16404 search results - page 2974 / 3281
» A set coverage problem
Sort
View
179
Voted
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
16 years 6 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
2008
ACM
134views Data Mining» more  KDD 2008»
16 years 6 months ago
Privacy-preserving cox regression for survival analysis
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...
KDD
2008
ACM
184views Data Mining» more  KDD 2008»
16 years 6 months ago
Joint latent topic models for text and citations
In this work, we address the problem of joint modeling of text and citations in the topic modeling framework. We present two different models called the Pairwise-Link-LDA and the ...
Ramesh Nallapati, Amr Ahmed, Eric P. Xing, William...
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
16 years 6 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
185
Voted
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
16 years 6 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
« Prev « First page 2974 / 3281 Last » Next »