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
    Kota Kinabalu
    期間15/5/3115/6/3

    Fingerprint

    Search engines
    Internet
    Data storage equipment

    ASJC Scopus subject areas

    • Control and Systems Engineering

    これを引用

    Yabuuchi, Y., Hung, H., & Watada, J. (2015). Summarizing approach for efficient search by k-medoids method. : 2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015 [7244622] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ASCC.2015.7244622

    Summarizing approach for efficient search by k-medoids method. / Yabuuchi, Yoshiyuki; Hung, Hungming; Watada, Junzo.

    2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7244622.

    研究成果: Conference contribution

    Yabuuchi, Y, Hung, H & Watada, J 2015, Summarizing approach for efficient search by k-medoids method. : 2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015., 7244622, Institute of Electrical and Electronics Engineers Inc., 10th Asian Control Conference, ASCC 2015, Kota Kinabalu, Malaysia, 15/5/31. https://doi.org/10.1109/ASCC.2015.7244622
    Yabuuchi Y, Hung H, Watada J. Summarizing approach for efficient search by k-medoids method. : 2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015. Institute of Electrical and Electronics Engineers Inc. 2015. 7244622 https://doi.org/10.1109/ASCC.2015.7244622
    Yabuuchi, Yoshiyuki ; Hung, Hungming ; Watada, Junzo. / Summarizing approach for efficient search by k-medoids method. 2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015. Institute of Electrical and Electronics Engineers Inc., 2015.
    @inproceedings{b74bec5244864797abd3484439358282,
    title = "Summarizing approach for efficient search by k-medoids method",
    abstract = "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.",
    author = "Yoshiyuki Yabuuchi and Hungming Hung and Junzo Watada",
    year = "2015",
    month = "9",
    day = "8",
    doi = "10.1109/ASCC.2015.7244622",
    language = "English",
    isbn = "9781479978625",
    booktitle = "2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - GEN

    T1 - Summarizing approach for efficient search by k-medoids method

    AU - Yabuuchi, Yoshiyuki

    AU - Hung, Hungming

    AU - Watada, Junzo

    PY - 2015/9/8

    Y1 - 2015/9/8

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=84957637543&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84957637543&partnerID=8YFLogxK

    U2 - 10.1109/ASCC.2015.7244622

    DO - 10.1109/ASCC.2015.7244622

    M3 - Conference contribution

    SN - 9781479978625

    BT - 2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -