Partitioning a graph in alliances and its application to data clustering

KH Shafique - 2004 - search.proquest.com
Any reasonably large group of individuals, families, states, and parties exhibits the
phenomenon of subgroup formations within the group such that the members of each group …

Clustering and group selection of multiple criteria alternatives with application to space-based networks

B Malakooti, Z Yang - IEEE Transactions on Systems, Man, and …, 2004 - ieeexplore.ieee.org
In many real-world problems, the range of consequences of different alternatives are
considerably different. In addition, sometimes, selection of a group of alternatives (instead of …

Towards hierarchical clustering

MS Levin - Computer Science–Theory and Applications: Second …, 2007 - Springer
In the paper, new modified agglomerative algorithms for hierarchical clustering are
suggested. The clustering process is targeted to generating a cluster hierarchy which can …

A fast algorithm for finding matching responses in a survey data table

JE Mullat - Mathematical Social Sciences, 1995 - Elsevier
The paper addresses an algorithm to perform an analysis on survey data tables with some
unreliable entries. The algorithm has almost linear complexity depending on the number of …

Set covering submodular maximization: An optimal algorithm for data mining in bioinformatics and medical informatics

A Genkin, CA Kulikowski… - Journal of Intelligent & …, 2002 - content.iospress.com
In this paper we show how several problems in different areas of data mining and
knowledge discovery can be viewed as finding the optimal covering of a finite set. Many …

[PDF][PDF] Wellness Club/Coalition Formation by Bargaining Based on Boolean Tables

JE Mullat - datalaundering.com
This study explores the nexus between the Nash Bargaining Problem and club/coalition
formation, elucidating the derivation of utility functions using Boolean tables. It appeals to …

Multi-criteria clustering for intelligent tele-communications systems

B Malakooti, Y Jung, K Bhasin, A Taber… - … on Systems, Man and …, 2002 - papers.ssrn.com
Intelligent mobile agents are sent between routers to carry out a set of required tasks. Mobile
agents can carry algorithms and information to various routers they visit. Critical information …

[PDF][PDF] Combinatorial clustering for textual data representation in machine learning models

A Anghelescu, I Muchnik - 2002 - academia.edu
In text stream analysis one of the main problems is finding an effective method to classify
documents fast and correctly. This is the reason why dimensionality reduction and related …

[PDF][PDF] Monitoring message streams: algorithmic methods for automatic processing of messages

PB Kantor, FS Roberts - Jornal of Intelligence Community Research and …, 2007 - Citeseer
The problem of monitoring message streams is decomposed into problems in compression,
representation, matching, learning and data fusion. A coordinated approach aimed at …

[PDF][PDF] Clustering Intelligent Mobile Agents for Communications Networks

B Malakooti, K Bhasin, J Mathewson… - IIE Annual Conference …, 2002 - Citeseer
Intelligent mobile agents are sent between routers to carry out a set of required tasks. Mobile
agents can carry algorithms and information to various routers that they visit, such as: timer …