Sciweavers

78 search results - page 4 / 16
» Learning similarity measures in non-orthogonal space
Sort
View
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
15 years 3 months ago
Statistical Learning Algorithm for Tree Similarity
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu
CHI
1999
ACM
15 years 1 months ago
Learning and Performing by Exploration: Label Quality Measured by Latent Semantic Analysis
Models of learning and performing by exploration assume that the semantic distance between task descriptions and screen labels controls in part the usersÕ search strategies. Neve...
Rodolfo Soto
DCC
2006
IEEE
15 years 9 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley
CVPR
2004
IEEE
15 years 11 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
ISAAC
2005
Springer
138views Algorithms» more  ISAAC 2005»
15 years 2 months ago
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
Zhixiang Chen, Bin Fu