Sciweavers

371 search results - page 8 / 75
» Learning to match and cluster large high-dimensional data se...
Sort
View
WEBI
2009
Springer
14 years 2 months 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
KDD
2003
ACM
180views Data Mining» more  KDD 2003»
14 years 8 months ago
Classifying large data sets using SVMs with hierarchical clusters
Support vector machines (SVMs) have been promising methods for classification and regression analysis because of their solid mathematical foundations which convey several salient ...
Hwanjo Yu, Jiong Yang, Jiawei Han
CVPR
2007
IEEE
14 years 2 months ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao
BMCBI
2008
148views more  BMCBI 2008»
13 years 7 months ago
Discovering biclusters in gene expression data based on high-dimensional linear geometries
Background: In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classifi...
Xiangchao Gan, Alan Wee-Chung Liew, Hong Yan
CIBCB
2006
IEEE
14 years 1 months ago
Visualization of Support Vector Machines with Unsupervised Learning
– The visualization of support vector machines in realistic settings is a difficult problem due to the high dimensionality of the typical datasets involved. However, such visuali...
Lutz Hamel