Sciweavers

82 search results - page 10 / 17
» Optimal core-sets for balls
Sort
View
KDD
2009
ACM
215views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale sparse logistic regression
Logistic Regression is a well-known classification method that has been used widely in many applications of data mining, machine learning, computer vision, and bioinformatics. Spa...
Jun Liu, Jianhui Chen, Jieping Ye
COLING
1996
13 years 8 months ago
Learning to Recognize Names Across Languages
The development of natural language proccssing (NLP) systems that perform machine translation (MT) and information retrieval (IR) has highlighted the need for the automatic recogn...
Anthony F. Gallippi
ICML
2005
IEEE
14 years 8 months ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh
ICML
2005
IEEE
14 years 8 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
WWW
2010
ACM
14 years 2 months ago
Web-scale k-means clustering
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
D. Sculley