Sciweavers

818 search results - page 76 / 164
» Clustering for music search results
Sort
View
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 7 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
14 years 3 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
IS
2008
13 years 9 months ago
Continuous subspace clustering in streaming time series
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clust...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
BMCBI
2006
97views more  BMCBI 2006»
13 years 9 months ago
REEF: searching REgionally Enriched Features in genomes
Background: In Eukaryotic genomes, different features including genes are not uniformly distributed. The integration of annotation information and genomic position of functional D...
Alessandro Coppe, Gian Antonio Danieli, Stefania B...
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
13 years 1 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache