Sciweavers

2932 search results - page 100 / 587
» Higher order mining
Sort
View
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
16 years 6 months ago
Go Green: Recycle and Reuse Frequent Patterns
In constrained data mining, users can specify constraints that can be used to prune the search space to avoid mining uninteresting knowledge. Since it is difficult to determine th...
Gao Cong, Beng Chin Ooi, Kian-Lee Tan, Anthony K. ...
146
Voted
GVD
2004
107views Database» more  GVD 2004»
15 years 6 months ago
A Representation of Time Series for Temporal Web Mining
Data with temporal information is constantly generated, sampled, gathered, and analyzed in different domains, such as medicine, finance, engineering, environmental sciences, and e...
Mireille Samia
JDWM
2007
90views more  JDWM 2007»
15 years 4 months ago
Mining for Mutually Exclusive Items in Transaction Databases
Association rule mining is a popular task that involves the discovery of co-occurences of items in transaction databases. Several extensions of the traditional association rule mi...
George Tzanis, Christos Berberidis
EUSFLAT
2009
233views Fuzzy Logic» more  EUSFLAT 2009»
15 years 2 months ago
SaM: A Split and Merge Algorithm for Fuzzy Frequent Item Set Mining
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not ...
Christian Borgelt, Xiaomeng Wang
CSL
2007
Springer
15 years 11 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel