Sciweavers

Share
ICDM
2006
IEEE
118views Data Mining» more  ICDM 2006»
9 years 4 months ago
Reducing the Frequent Pattern Set
One of the major problems in frequent pattern mining is the explosion of the number of results, making it difficult to identify the interesting frequent patterns. In a recent pap...
Ronnie Bathoorn, Arne Koopman, Arno Siebes
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
9 years 4 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
9 years 4 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
ICDM
2006
IEEE
135views Data Mining» more  ICDM 2006»
9 years 4 months ago
Discovering Frequent Poly-Regions in DNA Sequences
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
Panagiotis Papapetrou, Gary Benson, George Kollios
ICDM
2006
IEEE
115views Data Mining» more  ICDM 2006»
9 years 4 months ago
Concept-Aware Ranking: Teaching an Old Graph New Moves
Colin DeLong, Sandeep Mane, Jaideep Srivastava
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
9 years 4 months ago
Transforming Semi-Honest Protocols to Ensure Accountability
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy...
Wei Jiang, Chris Clifton
ICDM
2006
IEEE
153views Data Mining» more  ICDM 2006»
9 years 4 months ago
k-STARs: Sequences of Spatio-Temporal Association Rules
A Spatio-Temporal Association Rule (STAR) describes how objects move between regions over time. Since they describe only a single movement between two regions, it is very difficu...
Florian Verhein
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
9 years 4 months ago
Spatial Multidimensional Sequence Clustering
Measurements at different time points and positions in large temporal or spatial databases requires effective and efficient data mining techniques. For several parallel measureme...
Ira Assent, Ralph Krieger, Boris Glavic, Thomas Se...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
9 years 4 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
books