Summarizing approach for efficient search by k-medoids method

Yoshiyuki Yabuuchi, Hungming Hung, Junzo Watada

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (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.

    Original languageEnglish
    Title of host publication2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    ISBN (Print)9781479978625
    Publication statusPublished - 2015 Sept 8
    Event10th Asian Control Conference, ASCC 2015 - Kota Kinabalu, Malaysia
    Duration: 2015 May 312015 Jun 3


    Other10th Asian Control Conference, ASCC 2015
    CityKota Kinabalu

    ASJC Scopus subject areas

    • Control and Systems Engineering


    Dive into the research topics of 'Summarizing approach for efficient search by k-medoids method'. Together they form a unique fingerprint.

    Cite this