Sciweavers

299 search results - page 17 / 60
» Implicit Enumeration of Patterns
Sort
View
JSS
2007
88views more  JSS 2007»
13 years 9 months ago
SQUIRE: Sequential pattern mining with quantities
Discovering sequential patterns is an important problem for many applications. Existing algorithms find qualitative sequential patterns in the sense that only items are included ...
Chulyun Kim, Jong-Hwa Lim, Raymond T. Ng, Kyuseok ...
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
14 years 3 months ago
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represen...
Loïck Lhote, François Rioult, Arnaud S...
ICEIS
2009
IEEE
13 years 7 months ago
Mining Patterns in the Presence of Domain Knowledge
One of the main difficulties of pattern mining is to deal with items of different nature in the same itemset, which can occur in any domain except basket analysis. Indeed, if we co...
Cláudia Antunes
JCT
2010
117views more  JCT 2010»
13 years 8 months ago
(2+2)-free posets, ascent sequences and pattern avoiding permutations
Abstract. We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of involutions (or chord ...
Mireille Bousquet-Mélou, Anders Claesson, M...
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 9 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan