Sciweavers

453 search results - page 31 / 91
» Adaptable Similarity Search Using Vector Quantization
Sort
View
KDD
1998
ACM
112views Data Mining» more  KDD 1998»
15 years 1 months ago
Evaluating Usefulness for Dynamic Classification
This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as me...
Gholamreza Nakhaeizadeh, Charles Taylor, Carsten L...
ECAI
2008
Springer
14 years 11 months ago
WWW sits the SAT: Measuring Relational Similarity on the Web
Abstract. Measuring relational similarity between words is important in numerous natural language processing tasks such as solving analogy questions and classifying noun-modifier r...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
IJCNN
2006
IEEE
15 years 3 months ago
Learning to Segment Any Random Vector
— We propose a method that takes observations of a random vector as input, and learns to segment each observation into two disjoint parts. We show how to use the internal coheren...
Aapo Hyvärinen, Jukka Perkiö
ICML
2005
IEEE
15 years 10 months ago
The cross entropy method for classification
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
Shie Mannor, Dori Peleg, Reuven Y. Rubinstein
80
Voted
KDD
2004
ACM
146views Data Mining» more  KDD 2004»
15 years 10 months ago
Using Hyperlink Features to Personalize Web Search
Personalized search has gained great popularity to improve search effectiveness in recent years. The objective of personalized search is to provide users with information tailored ...
Mehmet S. Aktas, Mehmet A. Nacar, Filippo Menczer