Sciweavers

729 search results - page 70 / 146
» Hyperclique pattern discovery
Sort
View
SDM
2011
SIAM
218views Data Mining» more  SDM 2011»
14 years 2 months ago
Segmented nestedness in binary data
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...
Esa Junttila, Petteri Kaski
DAWAK
2005
Springer
15 years 5 months ago
Optimizing a Sequence of Frequent Pattern Queries
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user speci...
Mikolaj Morzy, Marek Wojciechowski, Maciej Zakrzew...
PAKDD
2001
ACM
157views Data Mining» more  PAKDD 2001»
15 years 4 months ago
Applying Pattern Mining to Web Information Extraction
Information extraction (IE) from semi-structured Web documents is a critical issue for information integration systems on the Internet. Previous work in wrapper induction aim to so...
Chia-Hui Chang, Shao-Chen Lui, Yen-Chin Wu
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
15 years 6 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
ICDM
2005
IEEE
177views Data Mining» more  ICDM 2005»
15 years 5 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...