Sciweavers

106 search results - page 10 / 22
» Finding Interesting Associations without Support Pruning
Sort
View
ECAI
2008
Springer
14 years 12 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
JCIT
2010
174views more  JCIT 2010»
14 years 4 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
POPL
2004
ACM
15 years 10 months ago
A type system for well-founded recursion
In the interest of designing a recursive module extension to ML that is as simple and general as possible, we propose a novel type system for general recursion over effectful expr...
Derek Dreyer
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
MMM
2007
Springer
107views Multimedia» more  MMM 2007»
15 years 4 months ago
Hierarchical Indexing Structure for 3D Human Motions
Content-based retrieval of 3D human motion capture data has significant impact in different fields such as physical medicine, rehabilitation, and animation. This paper develops ...
Gaurav N. Pradhan, Chuanjun Li, Balakrishnan Prabh...