Sciweavers

475 search results - page 2 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
13 years 9 months ago
Proposal and Empirical Comparison of a Parallelizable Distance-Based Discretization Method
Many classification algorithms are designed to work with datasets that contain only discrete attributes. Discretization is the process of converting the continuous attributes of ...
Jesús Cerquides, Ramon López de M&aa...
CVPR
2004
IEEE
13 years 8 months ago
Visual Object Categorization Using Distance-Based Discriminant Analysis
This paper formulates the problem of object categorization in the discriminant analysis framework focusing on transforming visual feature data so as to make it conform to the comp...
Serhiy Kosinov, Stéphane Marchand-Maillet, ...
IADIS
2008
13 years 6 months ago
Mib: Using Mutual Information for Biclustering High Dimensional Data
Most of the biclustering algorithms for gene expression data are based either on the Euclidean distance or correlation coefficient which capture only linear relationships. However...
Neelima Gupta, Seema Aggarwal
VLDB
1998
ACM
192views Database» more  VLDB 1998»
13 years 9 months ago
Algorithms for Mining Distance-Based Outliers in Large Datasets
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...
Edwin M. Knorr, Raymond T. Ng
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
13 years 11 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan