Sciweavers

2033 search results - page 162 / 407
» Ranking on Data Manifolds
Sort
View
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
16 years 7 months ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims
JIPS
2007
134views more  JIPS 2007»
15 years 6 months ago
An Efficient Functional Analysis Method for Micro-array Data Using Gene Ontology
: Microarray data includes tens of thousands of gene expressions simultaneously, so it can be effectively used in identifying the phenotypes of diseases. However, the retrieval of ...
Dong-wan Hong, Jong-keun Lee, Sung-soo Park, Sang-...
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
15 years 10 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
VIS
2006
IEEE
100views Visualization» more  VIS 2006»
16 years 7 months ago
Visualizing Abstract Data Using Animation
ing Abstract Data Using Animation Amit P. Sawant Department of Computer Science, North Carolina State University Christopher G. Healey Department of Computer Science, North Carolin...
Amit Sawant, Christopher Healey
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 7 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu