Sciweavers

587 search results - page 29 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
ICML
2007
IEEE
14 years 9 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
SDM
2012
SIAM
282views Data Mining» more  SDM 2012»
11 years 11 months ago
Citation Prediction in Heterogeneous Bibliographic Networks
To reveal information hiding in link space of bibliographical networks, link analysis has been studied from different perspectives in recent years. In this paper, we address a no...
Xiao Yu, Quanquan Gu, Mianwei Zhou, Jiawei Han
DIS
2010
Springer
13 years 7 months ago
Adapted Transfer of Distance Measures for Quantitative Structure-Activity Relationships
Quantitative structure-activity relationships (QSARs) are regression models relating chemical structure to biological activity. Such models allow to make predictions for toxicologi...
Ulrich Rückert, Tobias Girschick, Fabian Buch...
JMLR
2006
113views more  JMLR 2006»
13 years 8 months ago
Learning the Structure of Linear Latent Variable Models
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
Ricardo Silva, Richard Scheines, Clark Glymour, Pe...
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
14 years 9 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon