Extracting cover sets from free fuzzy sorting data

Extracting cover sets from free fuzzy sorting data Assignment of items to multiple categories requires suitable statistical methods. The present paper provides a new approach to solve this task. The concept of fuzzy sets is extended to cover sets (sets of overlapping clusters) in a simple manner introducing a vector of item membership sums. The application of the new concept is exemplified by modifying the fuzzy cluster analysis algorithm of Kaufman and Rousseeuw (Finding groups in data: an introduction to cluster analysis, 1990) to cover set cluster analysis appropriately. Wide equivalence of the numerical problems is demonstrated from Lagrange multipliers and Karush-Kuhn-Tucker conditions. Additionally, some extensions are introduced to the algorithm to improve its behavior for suboptimal large or small numbers of clusters. The adapted algorithm in most cases reproduces single sortings for correct numbers of clusters. Two applications to empirical free fuzzy sorting data sets are provided. Limitations of the algorithm are discussed. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quality & Quantity Springer Journals

Extracting cover sets from free fuzzy sorting data

Loading next page...
 
/lp/springer_journal/extracting-cover-sets-from-free-fuzzy-sorting-data-yJ1Kh0OrS0
Publisher
Springer Netherlands
Copyright
Copyright © 2011 by Springer Science+Business Media B.V.
Subject
Social Sciences; Methodology of the Social Sciences; Social Sciences, general
ISSN
0033-5177
eISSN
1573-7845
D.O.I.
10.1007/s11135-011-9497-y
Publisher site
See Article on Publisher Site

Abstract

Assignment of items to multiple categories requires suitable statistical methods. The present paper provides a new approach to solve this task. The concept of fuzzy sets is extended to cover sets (sets of overlapping clusters) in a simple manner introducing a vector of item membership sums. The application of the new concept is exemplified by modifying the fuzzy cluster analysis algorithm of Kaufman and Rousseeuw (Finding groups in data: an introduction to cluster analysis, 1990) to cover set cluster analysis appropriately. Wide equivalence of the numerical problems is demonstrated from Lagrange multipliers and Karush-Kuhn-Tucker conditions. Additionally, some extensions are introduced to the algorithm to improve its behavior for suboptimal large or small numbers of clusters. The adapted algorithm in most cases reproduces single sortings for correct numbers of clusters. Two applications to empirical free fuzzy sorting data sets are provided. Limitations of the algorithm are discussed.

Journal

Quality & QuantitySpringer Journals

Published: Apr 23, 2011

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from Google Scholar, PubMed
Create lists to organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off