Sciweavers

534 search results - page 45 / 107
» Approximation of Indistinct Concepts
Sort
View
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 9 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
JFPLC
2003
13 years 9 months ago
Une approche hybride pour l'optimisation multi-objectif sous contraintes
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
Vincent Barichard, Jin-Kao Hao
CJ
1998
118views more  CJ 1998»
13 years 7 months ago
Least-Squares Structuring, Clustering and Data Processing Issues
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Boris Mirkin
ISCI
1998
139views more  ISCI 1998»
13 years 7 months ago
A Rough Set Approach to Attribute Generalization in Data Mining
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
Chien-Chung Chan
SIAMSC
2011
110views more  SIAMSC 2011»
13 years 2 months ago
A Finite Element Method for Second Order Nonvariational Elliptic Problems
We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements...
Omar Lakkis, Tristan Pryer