Sciweavers

2065 search results - page 193 / 413
» Techniques of Cluster Algorithms in Data Mining
Sort
View
FIMI
2004
123views Data Mining» more  FIMI 2004»
15 years 8 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon
AICCSA
2008
IEEE
292views Hardware» more  AICCSA 2008»
16 years 1 months ago
Enumeration of maximal clique for mining spatial co-location patterns
This paper presents a systematic approach to mine colocation patterns in Sloan Digital Sky Survey (SDSS) data. SDSS Data Release 5 (DR5) contains 3.6 TB of data. Availability of s...
Ghazi Al-Naymat
CIBCB
2009
IEEE
15 years 7 months ago
A framework for the application of decision trees to the analysis of SNPs data
Data mining is the analysis of experimental datasets to extract trends and relationships that can be meaningful for the user. In genetic studies these techniques have revealed inte...
Linda Fiaschi, Jonathan M. Garibaldi, Natalio Kras...
ICDCS
2002
IEEE
15 years 11 months ago
Clustering Algorithms for Content-Based Publication-Subscription Systems
We consider efficient communication schemes based on both network-supported and application-level multicast techniques for content-based publication-subscription systems. We show...
Anton Riabov, Zhen Liu, Joel L. Wolf, Philip S. Yu...
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 7 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...