Sciweavers

567 search results - page 31 / 114
» Learning All Subfunctions of a Function
Sort
View
99
Voted
SIGIR
2004
ACM
15 years 6 months ago
A joint framework for collaborative and content filtering
This paper proposes a novel, unified, and systematic approach to combine collaborative and content-based filtering for ranking and user preference prediction. The framework inco...
Justin Basilico, Thomas Hofmann
87
Voted
ICANN
2003
Springer
15 years 5 months ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
16 years 26 days ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour
NIPS
2001
15 years 1 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
93
Voted
ICPR
2006
IEEE
16 years 1 months ago
Exploiting the Geometry of Gene Expression Patterns for Unsupervised Learning
Typical gene expression clustering algorithms are restricted to a specific underlying pattern model while overlooking the possibility that other information carrying patterns may ...
Rave Harpaz, Robert M. Haralick