抄録
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 31 → 2015 6 3 |
Other
| Other | 10th Asian Control Conference, ASCC 2015 |
|---|---|
| 国 | Malaysia |
| 市 | Kota Kinabalu |
| 期間 | 15/5/31 → 15/6/3 |
Fingerprint
ASJC Scopus subject areas
- Control and Systems Engineering
これを引用
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
}
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 -