Sciweavers

649 search results - page 25 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
BMCBI
2004
113views more  BMCBI 2004»
13 years 8 months ago
Influence of microarrays experiments missing values on the stability of gene groups by hierarchical clustering
Background: Microarray technologies produced large amount of data. The hierarchical clustering is commonly used to identify clusters of co-expressed genes. However, microarray dat...
Alexandre G. de Brevern, Serge A. Hazout, Alain Ma...
PRL
2002
95views more  PRL 2002»
13 years 8 months ago
Dissimilarity representations allow for building good classifiers
In this paper, a classification task on dissimilarity representations is considered. A traditional way to discriminate between objects represented by dissimilarities is the neares...
Elzbieta Pekalska, Robert P. W. Duin
BMCBI
2008
139views more  BMCBI 2008»
13 years 9 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 10 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
ICML
2007
IEEE
14 years 9 months ago
Neighbor search with global geometry: a minimax message passing algorithm
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
Kye-Hyeon Kim, Seungjin Choi