Summarizing approach for efficient search by k-medoids method

Yoshiyuki Yabuuchi, Hungming Hung, Junzo Watada

    研究成果: Conference contribution

    1 被引用数 (Scopus)

    抄録

    In past days, although we have focused on to collect required data, we can get required information since many data are storage and disclosed. Therefore, it has become a new task to search efficiently required information. Nowadays, the search engine such as Google, Bing and Baidu help us to search information in the internet. However, enormous number of search results is listed. In some cases, the number of search results can be more than a hundred million that are ranked by their relevancies to the search key words. It is difficult to find out the desired information because user's time and effort are required. In order to efficiently attain user's required information reach, although it is an effective way to rank data by their relevancies to the search key words, sometime it is better the way to summarize information. In this work, we propose summarizing approach for efficient search by k-medoids method. Without defining categories in advance, k-medoids method generates clusters with less susceptibility to noise. Experimental results verify our method's feasibility and effectiveness.

    本文言語English
    ホスト出版物のタイトル2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015
    出版社Institute of Electrical and Electronics Engineers Inc.
    ISBN(印刷版)9781479978625
    DOI
    出版ステータスPublished - 2015 9 8
    イベント10th Asian Control Conference, ASCC 2015 - Kota Kinabalu, Malaysia
    継続期間: 2015 5 312015 6 3

    Other

    Other10th Asian Control Conference, ASCC 2015
    国/地域Malaysia
    CityKota Kinabalu
    Period15/5/3115/6/3

    ASJC Scopus subject areas

    • 制御およびシステム工学

    フィンガープリント

    「Summarizing approach for efficient search by k-medoids method」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル