Sciweavers

50 search results - page 9 / 10
» Reducing the Dimensionality of Hyperspectral Data using Diff...
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 6 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
BMCBI
2008
153views more  BMCBI 2008»
13 years 5 months ago
2DB: a Proteomics database for storage, analysis, presentation, and retrieval of information from mass spectrometric experiments
Background: The amount of information stemming from proteomics experiments involving (multi dimensional) separation techniques, mass spectrometric analysis, and computational anal...
Jens Allmer, Sebastian Kuhlgert, Michael Hippler
NIPS
2003
13 years 6 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
WEBI
2009
Springer
14 years 4 days ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
AAAI
2008
13 years 7 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han