Sciweavers

873 search results - page 15 / 175
» Reducing the Frequent Pattern Set
Sort
View
ICDM
2006
IEEE
184views Data Mining» more  ICDM 2006»
14 years 1 months ago
MARGIN: Maximal Frequent Subgraph Mining
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
Lini T. Thomas, Satyanarayana R. Valluri, Kamalaka...
ICDM
2007
IEEE
166views Data Mining» more  ICDM 2007»
14 years 2 months ago
Mining Statistical Information of Frequent Fault-Tolerant Patterns in Transactional Databases
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
Ardian Kristanto Poernomo, Vivekanand Gopalkrishna...
BMCBI
2007
164views more  BMCBI 2007»
13 years 7 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 9 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
IJAR
2011
118views more  IJAR 2011»
12 years 11 months ago
A sequential pattern mining algorithm using rough set theory
Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns in time se...
Ken Kaneiwa, Yasuo Kudo