Sciweavers

119 search results - page 24 / 24
» icdm 2007
Sort
View
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
13 years 8 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
ICDM
2007
IEEE
140views Data Mining» more  ICDM 2007»
13 years 8 months ago
Sequential Change Detection on Data Streams
Model-based declarative queries are becoming an attractive paradigm for interacting with many data stream applications. This has led to the development of techniques to accurately...
S. Muthukrishnan, Eric van den Berg, Yihua Wu
DIS
2007
Springer
13 years 8 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
DKE
2007
105views more  DKE 2007»
13 years 4 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng