∑jJ1∑pj1vm.PDF

  1. 1、本文档共7页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
∑jJ1∑pj1vm.PDF

Manuscript Number : PMET −34 Title: Simultaneous Two-Way Fuzzy Clustering of Multiple Correspondence Analysis This paper concerns a method that combines Multiple Correspondence Analysis (MCA) with fuzzy k-means in a unified framework in order to classify the object scores of respondents and the weights for variable categories simultaneously; and this under the restriction that a common cluster is to be identified for a set of relatively homogenous respondents and variable categories. The paper seems very well motivated. The results of this type of work are quite encouraging; in particular as demonstrated by two applications (“The TV Program Preference Data” and “The French Worker Survey Data”). The joint maps offered by the proposed method, seem much easier to interpret due to simultaneous treatment of cluster structures of both respondents and variable categories. Specific comments and suggestions for improvement follow. Firstly, as far as I can tell, the approach of the paper deals with a problem which is equivalent to minimizing the following optimization criterion: J K N   ∑ SSF −Z W ∑ ∑ umSSf −b  j 1 j j k 1 i 1 ki i k K J Pj vm SSw −b  ∗∗∗ ∑ ∑ ∑p 1 kjp jp k k 1 j 1 with respect to F, W T , b , u , and v , subject to F F  I, and j k ki kjp K K T T ∑k 1 uki  ∑k 1 vkjp  1,where SSM traceM M traceMM . We suppose that these constraints are used as “hints” to guide the algorithm to a useful solution. The constraints do not seem clear because M

文档评论(0)

tangtianxu1 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档