Sciweavers

1413 search results - page 98 / 283
» Mining Multiple Large Databases
Sort
View
CIBCB
2008
IEEE
15 years 8 months ago
Very large scale ReliefF for genome-wide association analysis
— The genetic causes of many monogenic diseases have already been discovered. However, most common diseases are actually the result of complex nonlinear interactions between mult...
Margaret J. Eppstein, Paul Haake
KDD
2012
ACM
235views Data Mining» more  KDD 2012»
13 years 4 months ago
A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
Ninh Pham, Rasmus Pagh
CIKM
2004
Springer
15 years 7 months ago
Discovering frequently changing structures from historical structural deltas of unordered XML
Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic i...
Qiankun Zhao, Sourav S. Bhowmick, Mukesh K. Mohani...
KDD
2007
ACM
156views Data Mining» more  KDD 2007»
16 years 2 months ago
Estimating rates of rare events at multiple resolutions
We consider the problem of estimating occurrence rates of rare events for extremely sparse data, using pre-existing hierarchies to perform inference at multiple resolutions. In pa...
Deepak Agarwal, Andrei Z. Broder, Deepayan Chakrab...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 2 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