Sciweavers

1976 search results - page 358 / 396
» Predictive Graph Mining
Sort
View
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 28 days ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 11 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 11 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
SDM
2004
SIAM
165views Data Mining» more  SDM 2004»
13 years 9 months ago
Visualizing RFM Segmentation
Segmentation based on RFM (Recency, Frequency, and Monetary) has been used for over 50 years by direct marketers to target a subset of their customers, save mailing costs, and imp...
Ron Kohavi, Rajesh Parekh
BMCBI
2008
126views more  BMCBI 2008»
13 years 7 months ago
GeneChaser: Identifying all biological and clinical conditions in which genes of interest are differentially expressed
Background: The amount of gene expression data in the public repositories, such as NCBI Gene Expression Omnibus (GEO) has grown exponentially, and provides a gold mine for bioinfo...
Rong Chen, Rohan Mallelwar, Ajit Thosar, Shivkumar...