Close category search window
 

Automatic keyword extraction with relational clustering and Levenshtein distances

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

2 Author(s)
Runkler, T.A. ; Corp. Technol., Siemens AG, Munich, Germany ; Bezdek, J.C.

Alternating cluster estimation (ACE) is a generalized clustering model. Relational ACE is a modification of ACE that can be used to cluster data which do not possess a clear numerical representation, but for which a meaningful relation matrix can be defined. For text data sets we define (pairwise) relation matrices based on the Levenshtein string distance (1966). Relational ACE with Levenshtein distances is applied to four different texts. The cluster centers represent typical words in the texts, so this algorithm can be used to automatically determine keywords

Published in:
Fuzzy Systems, 2000. FUZZ IEEE 2000. The Ninth IEEE International Conference on  (Volume:2 )

Date of Conference: 2000

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.