Sciweavers

1709 search results - page 190 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
EVOW
2009
Springer
16 years 1 months ago
Clustering Metagenome Short Reads Using Weighted Proteins
Abstract. This paper proposes a new knowledge-based method for clustering metagenome short reads. The method incorporates biological knowledge in the clustering process, by means o...
Gianluigi Folino, Fabio Gori, Mike S. M. Jetten, E...
CVIU
2008
106views more  CVIU 2008»
15 years 6 months ago
Strategies for shape matching using skeletons
Skeletons are often used as a framework for part-based shape description and matching. This paper describes some useful strategies that can be employed to improve the performance ...
Wooi-Boon Goh
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 11 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
202
Voted
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 10 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 6 months ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen