Sciweavers

50 search results - page 8 / 10
» Using the fractal dimension to cluster datasets
Sort
View
MICAI
2005
Springer
14 years 4 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
DPD
2002
125views more  DPD 2002»
13 years 10 months ago
Parallel Mining of Outliers in Large Database
Data mining is a new, important and fast growing database application. Outlier (exception) detection is one kind of data mining, which can be applied in a variety of areas like mon...
Edward Hung, David Wai-Lok Cheung
AUSAI
2007
Springer
14 years 5 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
BMCBI
2010
125views more  BMCBI 2010»
13 years 11 months ago
NeatMap - non-clustering heat map alternatives in R
Background: The clustered heat map is the most popular means of visualizing genomic data. It compactly displays a large amount of data in an intuitive format that facilitates the ...
Satwik Rajaram, Yoshi Oono
CVPR
2008
IEEE
15 years 26 days ago
Graph commute times for image representation
We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of...
Nikos Paragios, Regis Behmo, Véronique Prin...