Sciweavers

942 search results - page 25 / 189
» Efficiently Mining Long Patterns from Databases
Sort
View
BALT
2006
15 years 1 months ago
Introducing Softness into Inductive Queries on String Databases
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
Ieva Mitasiunaite, Jean-François Boulicaut
96
Voted
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
14 years 9 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
14 years 11 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
ACL
2009
14 years 7 months ago
Mining Bilingual Data from the Web with Adaptively Learnt Patterns
Mining bilingual data (including bilingual sentences and terms1 ) from the Web can benefit many NLP applications, such as machine translation and cross language information retrie...
Long Jiang, Shiquan Yang, Ming Zhou, Xiaohua Liu, ...
84
Voted
JISE
2008
108views more  JISE 2008»
14 years 9 months ago
Efficient Discovery of Frequent Continuities by Projected Window List Technology
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin