Sciweavers

227 search results - page 26 / 46
» Rough Set Methods in Approximation of Hierarchical Concepts
Sort
View
CIKM
2000
Springer
14 years 1 days ago
A Semi-Supervised Document Clustering Technique for Information Organization
This paper discusses a new type of semi-supervised document clustering that uses partial supervision to partition a large set of documents. Most clustering methods organizes docum...
Han-joon Kim, Sang-goo Lee
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 8 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
MP
2008
126views more  MP 2008»
13 years 7 months ago
Geometry of interpolation sets in derivative free optimization
We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not available and cannot be dir...
Andrew R. Conn, Katya Scheinberg, Luís N. V...
ICASSP
2009
IEEE
14 years 2 months ago
Separable PCA for image classification
As an alternative to standard PCA, matrix-based image dimensionality reduction methods have recently been proposed and have gained attention due to reported computational efficie...
Yongxin Taylor Xi, Peter J. Ramadge