1301 search results - page 148 / 261 » Default Clustering from Sparse Data Sets |
PKDD
2001
Springer
14 years 1 months ago
2001
Springer
In some domains, Information Extraction (IE) from texts requires syntactic and semantic parsing. This analysis is computationally expensive and IE is potentially noisy if it applie...
IDA
2002
Springer
13 years 8 months ago
2002
Springer
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...
VLDB
2001
ACM
14 years 1 months ago
2001
ACM
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
ISBRA
2007
Springer
14 years 3 months ago
2007
Springer
Clustering algorithms are employed in many bioinformatics tasks, including categorization of protein sequences and analysis of gene-expression data. Although these algorithms are r...
DBISP2P
2003
Springer
14 years 2 months ago
2003
Springer
When joining information provider peers to a peer-to-peer network, an arbitrary distribution is sub-optimal. In fact, clustering peers by their characteristics, enhances search and...