Sciweavers

2463 search results - page 5 / 493
» Compressed Pattern Databases
Sort
View
KDD
2007
ACM
137views Data Mining» more  KDD 2007»
14 years 7 months ago
Characterising the difference
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
Jilles Vreeken, Matthijs van Leeuwen, Arno Siebes
MVA
2007
186views Computer Vision» more  MVA 2007»
13 years 8 months ago
Improving Rotation Invariance of the Volume Local Binary Pattern Operator
Dynamic texture is an extension of texture to the temporal domain. Recently, a powerful method for dynamic texture recognition based on volume local binary patterns (VLBP) was pro...
Guoying Zhao, Matti Pietikäinen
ICDM
2002
IEEE
156views Data Mining» more  ICDM 2002»
14 years 9 days ago
On Computing Condensed Frequent Pattern Bases
Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated i...
Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han
KDD
2006
ACM
139views Data Mining» more  KDD 2006»
14 years 7 months ago
Generating semantic annotations for frequent patterns with context analysis
As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on ...
Qiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, Che...
COMPSAC
2002
IEEE
14 years 10 days ago
A Dictionary-Based Compressed Pattern Matching Algorithm
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
Meng-Hang Ho, Hsu-Chun Yen