Sciweavers

128 search results - page 15 / 26
» On Mining Closed Sets in Multi-Relational Data
Sort
View
EDBT
2008
ACM
166views Database» more  EDBT 2008»
15 years 9 months ago
OrthoCluster: a new tool for mining synteny blocks and applications in comparative genomics
By comparing genomes among both closely and distally related species, comparative genomics analysis characterizes structures and functions of different genomes in both conserved a...
Xinghuo Zeng, Matthew J. Nesbitt, Jian Pei, Ke Wan...
ICDM
2009
IEEE
105views Data Mining» more  ICDM 2009»
15 years 4 months ago
Multi-document Summarization by Information Distance
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
15 years 10 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj
AUSDM
2006
Springer
91views Data Mining» more  AUSDM 2006»
15 years 1 months ago
Towards Automated Record Linkage
The field of Record Linkage is concerned with identifying records from one or more datasets which refer to the same underlying entities. Where entity-unique identifiers are not av...
Karl Goiser, Peter Christen
JIIS
2010
106views more  JIIS 2010»
14 years 4 months ago
A new classification of datasets for frequent itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
Frédéric Flouvat, Fabien De Marchi, ...