Sciweavers

1816 search results - page 353 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
87
Voted
CEC
2007
IEEE
15 years 4 months ago
Concerning the potential of evolutionary support vector machines
— Within the present paper, we put forward a novel hybridization between support vector machines and evolutionary algorithms. Evolutionary support vector machines consider the cl...
Ruxandra Stoean, Mike Preuss, Catalin Stoean, Dumi...
CIKM
2007
Springer
15 years 3 months ago
Using word similarity to eradicate junk emails
Emails are one of the most commonly used modern communication media these days; however, unsolicited emails obstruct this otherwise fast and convenient technology for information ...
Maria Soledad Pera, Yiu-Kai Ng
SPAA
1997
ACM
15 years 1 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 1 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
84
Voted
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
15 years 1 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian