Sciweavers

282 search results - page 56 / 57
» Generating non-redundant association rules
Sort
View
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
13 years 10 months ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
13 years 10 months ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
HASKELL
2007
ACM
13 years 9 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 5 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
EOR
2007
165views more  EOR 2007»
13 years 5 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang