Sciweavers

1403 search results - page 146 / 281
» Set cover algorithms for very large datasets
Sort
View
BMCBI
2010
121views more  BMCBI 2010»
15 years 6 months ago
A Markov blanket-based method for detecting causal SNPs in GWAS
Background: Detecting epistatic interactions associated with complex and common diseases can help to improve prevention, diagnosis and treatment of these diseases. With the develo...
Bing Han, Meeyoung Park, Xue-wen Chen
TKDE
1998
111views more  TKDE 1998»
15 years 5 months ago
Efficient Data Mining for Path Traversal Patterns
—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects...
Ming-Syan Chen, Jong Soo Park, Philip S. Yu
159
Voted
KDD
2004
ACM
138views Data Mining» more  KDD 2004»
16 years 6 months ago
IDR/QR: an incremental dimension reduction algorithm via QR decomposition
Dimension reduction is a critical data preprocessing step for many database and data mining applications, such as efficient storage and retrieval of high-dimensional data. In the ...
Jieping Ye, Qi Li, Hui Xiong, Haesun Park, Ravi Ja...
208
Voted
JMLR
2008
230views more  JMLR 2008»
15 years 6 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...
FPL
2008
Springer
122views Hardware» more  FPL 2008»
15 years 7 months ago
Mining Association Rules with systolic trees
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...
Song Sun, Joseph Zambreno