ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(トランザクション)
  2. データベース(TOD)[電子情報通信学会データ工学研究専門委員会共同編集]
  3. Vol.11
  4. No.1

Mining Alternative Actions from Community Q&A Corpus

https://ipsj.ixsq.nii.ac.jp/records/187174
https://ipsj.ixsq.nii.ac.jp/records/187174
149b2819-d319-4f74-ae27-c3a588ef7799
名前 / ファイル ライセンス アクション
IPSJ-TOD1101004.pdf IPSJ-TOD1101004.pdf (570.8 kB)
Copyright (c) 2018 by the Information Processing Society of Japan
オープンアクセス
Item type Trans(1)
公開日 2018-04-17
タイトル
タイトル Mining Alternative Actions from Community Q&A Corpus
タイトル
言語 en
タイトル Mining Alternative Actions from Community Q&A Corpus
言語
言語 eng
キーワード
主題Scheme Other
主題 [研究論文] community Q&A, task-oriented search, query suggestion
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
Graduate School of Informatics, Kyoto University
著者所属
Graduate School of Informatics, Kyoto University
著者所属
Yahoo Japan Corporation
著者所属
Yahoo Japan Corporation
著者所属
Graduate School of Informatics, Kyoto University
著者所属
Graduate School of Informatics, Kyoto University
著者所属(英)
en
Graduate School of Informatics, Kyoto University
著者所属(英)
en
Graduate School of Informatics, Kyoto University
著者所属(英)
en
Yahoo Japan Corporation
著者所属(英)
en
Yahoo Japan Corporation
著者所属(英)
en
Graduate School of Informatics, Kyoto University
著者所属(英)
en
Graduate School of Informatics, Kyoto University
著者名 Suppanut, Pothirattanachaikul

× Suppanut, Pothirattanachaikul

Suppanut, Pothirattanachaikul

Search repository
Takehiro, Yamamoto

× Takehiro, Yamamoto

Takehiro, Yamamoto

Search repository
Sumio, Fujita

× Sumio, Fujita

Sumio, Fujita

Search repository
Akira, Tajima

× Akira, Tajima

Akira, Tajima

Search repository
Katsumi, Tanaka

× Katsumi, Tanaka

Katsumi, Tanaka

Search repository
Masatoshi, Yoshikawa

× Masatoshi, Yoshikawa

Masatoshi, Yoshikawa

Search repository
著者名(英) Suppanut, Pothirattanachaikul

× Suppanut, Pothirattanachaikul

en Suppanut, Pothirattanachaikul

Search repository
Takehiro, Yamamoto

× Takehiro, Yamamoto

en Takehiro, Yamamoto

Search repository
Sumio, Fujita

× Sumio, Fujita

en Sumio, Fujita

Search repository
Akira, Tajima

× Akira, Tajima

en Akira, Tajima

Search repository
Katsumi, Tanaka

× Katsumi, Tanaka

en Katsumi, Tanaka

Search repository
Masatoshi, Yoshikawa

× Masatoshi, Yoshikawa

en Masatoshi, Yoshikawa

Search repository
論文抄録
内容記述タイプ Other
内容記述 Web searchers often use a Web search engine to find a way or means to achieve his/her goal. For example, a user intending to solve his/her sleeping problem, the query “sleeping pills” may be used. However, there may be another solution to achieve the same goal, such as “have a cup of hot milk” or “stroll before bedtime.” The problem is that the user may not be aware that these solutions exist. Thus, he/she will probably choose to take a sleeping pill without considering these solutions. In this study, we define and tackle the alternative action mining problem. In particular, we attempt to develop a method for mining alternative actions for a given query. We define alternative actions as actions which share the same goal and define the alternative action mining problem as similar in the search result diversification. To tackle the problem, we propose leveraging a community Q&A (cQA) corpus for mining alternative actions. The cQA corpus can be seen as an archival dataset comprising dialogues between questioners, who want to know the solutions to their problem, and respondents, who suggest different solutions. We propose a method to compute how well two actions can be alternative actions by using a question-answer structure in a cQA corpus. Our method builds a question-action bipartite graph and recursively computes how well two actions can be alternative actions. We conducted experiments to investigate the effectiveness of our method using two newly built test collections, each containing 50 queries. The experimental results indicated that, for Japanese test collection, our proposed method significantly outperformed two types of baselines, one used the conventional query suggestions and the other extracted alternative-actions from the Web documents, in terms of D#-nDCG@8. Also, for English test collection, our method significantly outperformed the baseline using the conventional query suggestions in terms of D#-nDCG@8.
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.26(2018) (online)
------------------------------
論文抄録(英)
内容記述タイプ Other
内容記述 Web searchers often use a Web search engine to find a way or means to achieve his/her goal. For example, a user intending to solve his/her sleeping problem, the query “sleeping pills” may be used. However, there may be another solution to achieve the same goal, such as “have a cup of hot milk” or “stroll before bedtime.” The problem is that the user may not be aware that these solutions exist. Thus, he/she will probably choose to take a sleeping pill without considering these solutions. In this study, we define and tackle the alternative action mining problem. In particular, we attempt to develop a method for mining alternative actions for a given query. We define alternative actions as actions which share the same goal and define the alternative action mining problem as similar in the search result diversification. To tackle the problem, we propose leveraging a community Q&A (cQA) corpus for mining alternative actions. The cQA corpus can be seen as an archival dataset comprising dialogues between questioners, who want to know the solutions to their problem, and respondents, who suggest different solutions. We propose a method to compute how well two actions can be alternative actions by using a question-answer structure in a cQA corpus. Our method builds a question-action bipartite graph and recursively computes how well two actions can be alternative actions. We conducted experiments to investigate the effectiveness of our method using two newly built test collections, each containing 50 queries. The experimental results indicated that, for Japanese test collection, our proposed method significantly outperformed two types of baselines, one used the conventional query suggestions and the other extracted alternative-actions from the Web documents, in terms of D#-nDCG@8. Also, for English test collection, our method significantly outperformed the baseline using the conventional query suggestions in terms of D#-nDCG@8.
------------------------------
This is a preprint of an article intended for publication Journal of
Information Processing(JIP). This preprint should not be cited. This
article should be cited as: Journal of Information Processing Vol.26(2018) (online)
------------------------------
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA11464847
書誌情報 情報処理学会論文誌データベース(TOD)

巻 11, 号 1, 発行日 2018-04-17
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7799
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-20 02:23:49.025564
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3