Sciweavers

404 search results - page 5 / 81
» Structure Discovery from Sequential Data
Sort
View
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
14 years 2 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
DGO
2003
140views Education» more  DGO 2003»
13 years 11 months ago
Social Welfare Program Administration and Evaluation and Policy Analysis Using Knowledge Discovery and Data Mining (KDD) on Admi
New technology in knowledge discovery and data mining (KDD) make it possible to extract valuable information from operational data. Private businesses already use the technology f...
Hye-Chung (Monica) Kum, Dean Duncan, Kimberly Flai...
ENC
2004
IEEE
14 years 1 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...
ICDM
2003
IEEE
154views Data Mining» more  ICDM 2003»
14 years 3 months ago
Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds
In this paper we study the problem of classifying chemical compound datasets. We present a sub-structure-based classification algorithm that decouples the sub-structure discovery...
Mukund Deshpande, Michihiro Kuramochi, George Kary...
PPL
2008
99views more  PPL 2008»
13 years 9 months ago
A Modular Implementation of Data Structures in Bulk-Synchronous Parallel ML
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...
Frédéric Gava