Sciweavers

2190 search results - page 138 / 438
» Learning with the Set Covering Machine
Sort
View
COLT
2010
Springer
13 years 7 months ago
Composite Objective Mirror Descent
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
John Duchi, Shai Shalev-Shwartz, Yoram Singer, Amb...
ICML
2008
IEEE
14 years 10 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
PAKDD
2009
ACM
96views Data Mining» more  PAKDD 2009»
14 years 4 months ago
Aggregated Subset Mining
The usual data mining setting uses the full amount of data to derive patterns for different purposes. Taking cues from machine learning techniques, we explore ways to divide the d...
Albrecht Zimmermann, Björn Bringmann
MLDM
2009
Springer
14 years 3 months ago
Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization
A number of two-class classification methods first discretize each attribute of two given training sets and then construct a propositional DNF formula that evaluates to True for ...
Klaus Truemper
ECML
2007
Springer
14 years 3 months ago
Data Mining of Multi-categorized Data
At the International Research and Educational Institute for Integrated Medical Sciences (IREIIMS) project, we are collecting complete medical data sets to determine relationships b...
Akinori Abe, Norihiro Hagita, Michiko Furutani, Yo...