Sciweavers

112 search results - page 18 / 23
» Efficient Approximate Mining of Frequent Patterns over Trans...
Sort
View
ENC
2004
IEEE
15 years 1 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
15 years 10 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...
SIGKDD
2008
125views more  SIGKDD 2008»
14 years 9 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun
TKDE
2011
183views more  TKDE 2011»
14 years 4 months ago
Mining Discriminative Patterns for Classifying Trajectories on Road Networks
—Classification has been used for modeling many kinds of data sets, including sets of items, text documents, graphs, and networks. However, there is a lack of study on a new kind...
Jae-Gil Lee, Jiawei Han, Xiaolei Li, Hong Cheng
68
Voted
TCS
2008
14 years 9 months ago
Itemset frequency satisfiability: Complexity and axiomatization
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
Toon Calders