Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
A fuzzy clustering algorithm for graph bisection
Information Processing Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
GD '96 Proceedings of the Symposium on Graph Drawing
Graph Clustering Using Multiway Ratio Cut
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
Cluster Analysis
Analysis of Clustering Algorithms for Web-Based Search
PAKM '02 Proceedings of the 4th International Conference on Practical Aspects of Knowledge Management
Multi-attribute Text Classification Using the Fuzzy Borda Method and Semantic Grades
WILF '07 Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory
A probabilistic majorclust variant for the clustering of near-homogeneous graphs
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Impact of sanitized message flows in a cooperative intrusion warning system
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
An approach to clustering abstracts
NLDB'05 Proceedings of the 10th international conference on Natural Language Processing and Information Systems
| Hi-index | 0.00 |
When working on systems of the real world, abstractions in the form of graphs have proven a superior modeling and representation approach. This paper is on the analysis of such graphs. Based on the paradigm that a graph of a system contains information about the system's structure, the paper contributes within the following respects: 1. It introduces a new and lucid structure measure, the so-called weighted partial connectivity, Λ, whose maximization defines a graph's structure (Section 2). 2. It presents a fast algorithm that approximates a graph's optimum Λ-value (Section 3). Moreover, the proposed structure definition is compared to existing clustering approaches (Section 4), resulting in a new splitting theorem concerning the well-known minimum cut splitting measure. A key concept of the proposed structure definition is its implicit determination of an optimum number of clusters. Different applications, which illustrate the usability of the measure and the algorithm, round off the paper (Section 5).