Sciweavers

155 search results - page 22 / 31
» ETP-Mine: An Efficient Method for Mining Transitional Patter...
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
ISBRA
2009
Springer
14 years 2 months ago
Mining of cis-Regulatory Motifs Associated with Tissue-Specific Alternative Splicing
KIM, JIHYE. Mining of Cis-Regulatory Motifs Associated with Tissue-Specific Alternative Splicing. (Under the direction of Steffen Heber). Alternative splicing (AS) is an important...
Jihye Kim, Sihui Zhao, Brian E. Howard, Steffen He...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
KDD
2004
ACM
151views Data Mining» more  KDD 2004»
14 years 8 months ago
Feature selection in scientific applications
Numerous applications of data mining to scientific data involve the induction of a classification model. In many cases, the collection of data is not performed with this task in m...
Erick Cantú-Paz, Shawn Newsam, Chandrika Ka...
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar