Sciweavers

732 search results - page 99 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
14 years 8 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
ENC
2004
IEEE
13 years 11 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...
ESANN
2004
13 years 9 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
SIGMOD
2005
ACM
150views Database» more  SIGMOD 2005»
14 years 7 months ago
BRAID: Stream Mining through Group Lag Correlations
The goal is to monitor multiple numerical streams, and determine which pairs are correlated with lags, as well as the value of each such lag. Lag correlations (and anticorrelation...
Yasushi Sakurai, Spiros Papadimitriou, Christos Fa...
EMS
2008
IEEE
14 years 2 months ago
A Weighted Utility Framework for Mining Association Rules
Association rule mining (ARM) identifies frequent itemsets from databases and generates association rules by assuming that all items have the same significance and frequency of oc...
M. Sulaiman Khan, Maybin K. Muyeba, Frans Coenen