Sciweavers

1244 search results - page 6 / 249
» Searching in Higher Dimension
Sort
View
PR
2007
100views more  PR 2007»
13 years 8 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
WEBI
2005
Springer
14 years 2 months ago
Adding the Temporal Dimension to Search - A Case Study in Publication Search
The most well known search techniques are perhaps the PageRank and HITS algorithms. In this paper we argue that these algorithms miss an important dimension, the temporal dimensio...
Philip S. Yu, Xin Li, Bing Liu
SDM
2007
SIAM
96views Data Mining» more  SDM 2007»
13 years 10 months ago
Higher Order Orthogonal Iteration of Tensors (HOOI) and its Relation to PCA and GLRAM
This paper presents a unified view of a number of dimension reduction techniques under the common framework of tensors. Specifically, it is established that PCA, and the recentl...
Bernard N. Sheehan, Yousef Saad
WWW
2007
ACM
14 years 9 months ago
Summary attributes and perceived search quality
We conducted a series of experiments in which surveyed web search users answered questions about the quality of search results on the basis of the result summaries. Summaries show...
Daniel E. Rose, David Orr, Raj Gopal Prasad Kantam...
CVPR
2000
IEEE
14 years 10 months ago
Nearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
Sung-Hyuk Cha, Sargur N. Srihari