Sciweavers

346 search results - page 15 / 70
» A New Approximate Maximal Margin Classification Algorithm
Sort
View
GECCO
2006
Springer
214views Optimization» more  GECCO 2006»
13 years 11 months ago
A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set
Many data mining applications involve the task of building a model for predictive classification. The goal of such a model is to classify examples (records or data instances) into...
Elon S. Correa, Alex Alves Freitas, Colin G. Johns...
COCOA
2008
Springer
13 years 9 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
13 years 11 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
NIPS
2001
13 years 9 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
14 years 8 months ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos