Sciweavers

942 search results - page 88 / 189
» Efficiently Mining Long Patterns from Databases
Sort
View
KDD
2003
ACM
192views Data Mining» more  KDD 2003»
15 years 10 months ago
Efficient elastic burst detection in data streams
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
Yunyue Zhu, Dennis Shasha
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
15 years 10 months ago
Using retrieval measures to assess similarity in mining dynamic web clickstreams
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
Olfa Nasraoui, Cesar Cardona, Carlos Rojas
FIMI
2003
120views Data Mining» more  FIMI 2003»
14 years 11 months ago
MAFIA: A Performance Study of Mining Maximal Frequent Itemsets
We present a performance study of the MAFIA algorithm for mining maximal frequent itemsets from a transactional database. In a thorough experimental analysis, we isolate the effec...
Douglas Burdick, Manuel Calimlim, Jason Flannick, ...
CINQ
2004
Springer
225views Database» more  CINQ 2004»
15 years 3 months ago
A Data Mining Query Language for Knowledge Discovery in a Geographical Information System
Spatial data mining is a process used to discover interesting but not explicitly available, highly usable patterns embedded in both spatial and nonspatial data, which are possibly ...
Donato Malerba, Annalisa Appice, Michelangelo Ceci
KDD
2002
ACM
154views Data Mining» more  KDD 2002»
15 years 10 months ago
Mining Protein Contact Maps
The 3D conformation of a protein may be compactly represented in a symmetrical, square, boolean matrix of pairwise, inter-residue contacts, or "contact map". The contact...
Jingjing Hu, Xiaolan Shen, Yu Shao, Chris Bystroff...