National Tsing Hua University Institutional Repository:A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 13863074      在线人数 : 229
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80763


    题名: A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis
    作者: Chang, C. L.;Lee, R. C. T.
    教師: 李家同
    日期: 1973
    出版者: Institute of Electrical and Electronics Engineers
    關聯: IEEE Transactions on Systems, Man, and Cybernetics, Institute of Electrical and Electronics Engineers, Volume SMC-3, Issue 2, 1973, Pages 197-200
    关键词: Heuristic Method
    Cluster Analysis
    Non-linear
    摘要: A relaxation method mapping high-dimensional sample points to low-dimensional sample points is discussed. This method tries to preserve the local interdistance of sample points. Some special heuristics have been introduced to handle the difficulty arising from a large amount of data. Experimental results with handwritten character data and Iris data show that the method runs fast, converges rapidly, and requires a small amount of memory space.
    相関连結: http://www.ieee.org/index.html
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80763
    显示于类别:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML1305检视/开启


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈