Sciweavers

360 search results - page 39 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 5 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
PRL
2008
135views more  PRL 2008»
13 years 7 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa
ER
2008
Springer
134views Database» more  ER 2008»
13 years 9 months ago
On Measuring Process Model Similarity Based on High-Level Change Operations
For various applications there is the need to compare the similarity between two process models. For example, given the as-is and to-be models of a particular business process, we ...
Chen Li, Manfred Reichert, Andreas Wombacher
CIKM
2005
Springer
14 years 1 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
ICASSP
2011
IEEE
12 years 11 months ago
Efficient search of music pitch contours using wavelet transforms and segmented dynamic time warping
We propose a method of music melody matching based on their “continuous” (or “time-frame-based”) pitch contours. Most previous methods using frame-based contours either ma...
Woojay Jeon, Changxue Ma