Sciweavers

705 search results - page 7 / 141
» Proximity Cluster Trees
Sort
View
SIGSOFT
2006
ACM
14 years 8 months ago
Failure proximity: a fault localization-based approach
Recent software systems usually feature an automated failure reporting system, with which a huge number of failing traces are collected every day. In order to prioritize fault dia...
Chao Liu 0001, Jiawei Han
BMCBI
2004
87views more  BMCBI 2004»
13 years 7 months ago
Selection of informative clusters from hierarchical cluster tree with gene classes
Background: A common clustering method in the analysis of gene expression data has been hierarchical clustering. Usually the analysis involves selection of clusters by cutting the...
Petri Törönen
CIKM
1994
Springer
13 years 11 months ago
Hashing by Proximity to Process Duplicates in Spatial Databases
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
Walid G. Aref, Hanan Samet
SPIRE
2005
Springer
14 years 1 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
14 years 8 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su