Cart (Loading....) | Create Account
Close category search window

Cohesive subgroup model for graph-based text mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Balasundaram, B. ; Sch. of Ind. Eng. & Manage., Oklahoma State Univ., Stillwater, OK

A k-plex is a graph theoretic generalization of a clique, introduced in social network analysis (SNA) to model tightly knit social subgroups referred to as cohesive subgroups. Clique model was the earliest mathematical model for a cohesive subgroup, but its overly restrictive definition motivated several relaxations including the k-plex model. The models from SNA are suitable, and potentially more realistic cluster models for graph-based clustering and data mining. This article will discuss the applicability of the k-plex model and its advantages compared to the clique model. Some recent developments in integer programming based approaches to identify large k-plexes would be described and the approaches demonstrated on a text mining network.

Published in:

Automation Science and Engineering, 2008. CASE 2008. IEEE International Conference on

Date of Conference:

23-26 Aug. 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.