Sciweavers

464 search results - page 23 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
ICML
2010
IEEE
14 years 10 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
IMAMS
2007
151views Mathematics» more  IMAMS 2007»
14 years 11 months ago
Discrete Harmonic Functions from Local Coordinates
Abstract. In this work we focus on approximations of continuous harmonic functions by discrete harmonic functions based on the discrete Laplacian in a triangulation of a point set....
Tom Bobach, Gerald E. Farin, Dianne Hansford, Geor...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 6 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
81
Voted
IJCAI
2007
14 years 11 months ago
A Scalable Kernel-Based Algorithm for Semi-Supervised Metric Learning
In recent years, metric learning in the semisupervised setting has aroused a lot of research interests. One type of semi-supervised metric learning utilizes supervisory informatio...
Dit-Yan Yeung, Hong Chang, Guang Dai
ERLANG
2008
ACM
14 years 11 months ago
Early fault detection with model-based testing
Current and future trends for software include increasingly complex requirements on interaction between systems. As a result, the difficulty of system testing increases. Model-bas...
Jonas Boberg