Sciweavers

8294 search results - page 985 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
ICML
2001
IEEE
16 years 8 months ago
Estimating a Kernel Fisher Discriminant in the Presence of Label Noise
Data noise is present in many machine learning problems domains, some of these are well studied but others have received less attention. In this paper we propose an algorithm for ...
Bernhard Schölkopf, Neil D. Lawrence
ICALP
2009
Springer
16 years 7 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
ISAAC
2007
Springer
111views Algorithms» more  ISAAC 2007»
16 years 1 months ago
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
Jiong Guo
FSKD
2005
Springer
95views Fuzzy Logic» more  FSKD 2005»
16 years 1 months ago
The Fuzzy Mega-cluster: Robustifying FCM by Scaling Down Memberships
A new robust clustering scheme based on fuzzy c-means is proposed and the concept of a fuzzy mega-cluster is introduced in this paper. The fuzzy mega-cluster is conceptually simila...
Amit Banerjee, Rajesh N. Davé
COLT
2004
Springer
16 years 26 days ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi