A relation-aware representation approach for the question matching system
Online question matching is the process of comparing user queries with system questions to find appropriate answers. This task has become increasingly important with the popularity of knowledge sharing social networks in product search and intelligent Q &A in customer service. Many previous stud...
Gespeichert in:
Veröffentlicht in: | World wide web (Bussum) 2024-03, Vol.27 (2), p.17, Article 17 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 2 |
container_start_page | 17 |
container_title | World wide web (Bussum) |
container_volume | 27 |
creator | Chen, Yanmin Chen, Enhong Zhang, Kun Liu, Qi Sun, Ruijun |
description | Online question matching is the process of comparing user queries with system questions to find appropriate answers. This task has become increasingly important with the popularity of knowledge sharing social networks in product search and intelligent Q &A in customer service. Many previous studies have focused on designing complex semantic structures through the questions themselves. In fact, the online user’s queries accumulate a large number of similar sentences, which have been grouped by semantics in the retrieval system. However, how to use these sentences to enhance the understanding of system questions is rarely studied. In this paper, we propose a novel Relation-aware Semantic Enhancement Network (RSEN) model. Specifically, we leverage the labels of the history records to identify different semantically related sentences. Then, we construct an expanded relation network to integrate the representation of different semantic relations. Furthermore, we interact we integrate the features of the system question with the semantically related sentences to augment the semantic information. Finally, we evaluate our proposed RSEN on two publicly available datasets. The results demonstrate the effectiveness of our proposed RSEN method compared to the advanced baselines. |
doi_str_mv | 10.1007/s11280-024-01255-6 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2931871016</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2931871016</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-d5864f385b82a1ce4b66edc7336789d178aba8b9db296ff68df449aff1659de53</originalsourceid><addsrcrecordid>eNp9UF1LwzAUDaLgnP4Bnwo-R3OT5utxDHWDgS8KvoW0TdaOra1Jh-zfm7WCbz7dr3POPRyE7oE8AiHyKQJQRTChOSZAOcfiAs2AS4YhB3aZeqZE6vnnNbqJcUcIEUzDDK0XWXB7OzRdi-23DS6NfXDRtcO4zGzfh86Wdea7kA21y76OLo6Xgx3Kumm3WTzFwR1u0ZW3--jufuscfbw8vy9XePP2ul4uNrikkgy44krknileKGqhdHkhhKtKyZiQSlcglS2sKnRVUC28F6ryea6t9yC4rhxnc_Qw6SZfoxez646hTS8N1QyUBAIioeiEKkMXY3De9KE52HAyQMw5MjNFZlJkZozMnElsIsUEbrcu_En_w_oBhKFvhQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2931871016</pqid></control><display><type>article</type><title>A relation-aware representation approach for the question matching system</title><source>SpringerLink Journals</source><creator>Chen, Yanmin ; Chen, Enhong ; Zhang, Kun ; Liu, Qi ; Sun, Ruijun</creator><creatorcontrib>Chen, Yanmin ; Chen, Enhong ; Zhang, Kun ; Liu, Qi ; Sun, Ruijun</creatorcontrib><description>Online question matching is the process of comparing user queries with system questions to find appropriate answers. This task has become increasingly important with the popularity of knowledge sharing social networks in product search and intelligent Q &A in customer service. Many previous studies have focused on designing complex semantic structures through the questions themselves. In fact, the online user’s queries accumulate a large number of similar sentences, which have been grouped by semantics in the retrieval system. However, how to use these sentences to enhance the understanding of system questions is rarely studied. In this paper, we propose a novel Relation-aware Semantic Enhancement Network (RSEN) model. Specifically, we leverage the labels of the history records to identify different semantically related sentences. Then, we construct an expanded relation network to integrate the representation of different semantic relations. Furthermore, we interact we integrate the features of the system question with the semantically related sentences to augment the semantic information. Finally, we evaluate our proposed RSEN on two publicly available datasets. The results demonstrate the effectiveness of our proposed RSEN method compared to the advanced baselines.</description><identifier>ISSN: 1386-145X</identifier><identifier>EISSN: 1573-1413</identifier><identifier>DOI: 10.1007/s11280-024-01255-6</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Computer Science ; Customer services ; Database Management ; Information Systems Applications (incl.Internet) ; Matching ; Operating Systems ; Query processing ; Questions ; Representations ; Semantics ; Sentences ; Social networks</subject><ispartof>World wide web (Bussum), 2024-03, Vol.27 (2), p.17, Article 17</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c270t-d5864f385b82a1ce4b66edc7336789d178aba8b9db296ff68df449aff1659de53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11280-024-01255-6$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11280-024-01255-6$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Chen, Yanmin</creatorcontrib><creatorcontrib>Chen, Enhong</creatorcontrib><creatorcontrib>Zhang, Kun</creatorcontrib><creatorcontrib>Liu, Qi</creatorcontrib><creatorcontrib>Sun, Ruijun</creatorcontrib><title>A relation-aware representation approach for the question matching system</title><title>World wide web (Bussum)</title><addtitle>World Wide Web</addtitle><description>Online question matching is the process of comparing user queries with system questions to find appropriate answers. This task has become increasingly important with the popularity of knowledge sharing social networks in product search and intelligent Q &A in customer service. Many previous studies have focused on designing complex semantic structures through the questions themselves. In fact, the online user’s queries accumulate a large number of similar sentences, which have been grouped by semantics in the retrieval system. However, how to use these sentences to enhance the understanding of system questions is rarely studied. In this paper, we propose a novel Relation-aware Semantic Enhancement Network (RSEN) model. Specifically, we leverage the labels of the history records to identify different semantically related sentences. Then, we construct an expanded relation network to integrate the representation of different semantic relations. Furthermore, we interact we integrate the features of the system question with the semantically related sentences to augment the semantic information. Finally, we evaluate our proposed RSEN on two publicly available datasets. The results demonstrate the effectiveness of our proposed RSEN method compared to the advanced baselines.</description><subject>Computer Science</subject><subject>Customer services</subject><subject>Database Management</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Matching</subject><subject>Operating Systems</subject><subject>Query processing</subject><subject>Questions</subject><subject>Representations</subject><subject>Semantics</subject><subject>Sentences</subject><subject>Social networks</subject><issn>1386-145X</issn><issn>1573-1413</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9UF1LwzAUDaLgnP4Bnwo-R3OT5utxDHWDgS8KvoW0TdaOra1Jh-zfm7WCbz7dr3POPRyE7oE8AiHyKQJQRTChOSZAOcfiAs2AS4YhB3aZeqZE6vnnNbqJcUcIEUzDDK0XWXB7OzRdi-23DS6NfXDRtcO4zGzfh86Wdea7kA21y76OLo6Xgx3Kumm3WTzFwR1u0ZW3--jufuscfbw8vy9XePP2ul4uNrikkgy44krknileKGqhdHkhhKtKyZiQSlcglS2sKnRVUC28F6ryea6t9yC4rhxnc_Qw6SZfoxez646hTS8N1QyUBAIioeiEKkMXY3De9KE52HAyQMw5MjNFZlJkZozMnElsIsUEbrcu_En_w_oBhKFvhQ</recordid><startdate>20240301</startdate><enddate>20240301</enddate><creator>Chen, Yanmin</creator><creator>Chen, Enhong</creator><creator>Zhang, Kun</creator><creator>Liu, Qi</creator><creator>Sun, Ruijun</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20240301</creationdate><title>A relation-aware representation approach for the question matching system</title><author>Chen, Yanmin ; Chen, Enhong ; Zhang, Kun ; Liu, Qi ; Sun, Ruijun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-d5864f385b82a1ce4b66edc7336789d178aba8b9db296ff68df449aff1659de53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science</topic><topic>Customer services</topic><topic>Database Management</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Matching</topic><topic>Operating Systems</topic><topic>Query processing</topic><topic>Questions</topic><topic>Representations</topic><topic>Semantics</topic><topic>Sentences</topic><topic>Social networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Yanmin</creatorcontrib><creatorcontrib>Chen, Enhong</creatorcontrib><creatorcontrib>Zhang, Kun</creatorcontrib><creatorcontrib>Liu, Qi</creatorcontrib><creatorcontrib>Sun, Ruijun</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>World wide web (Bussum)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Yanmin</au><au>Chen, Enhong</au><au>Zhang, Kun</au><au>Liu, Qi</au><au>Sun, Ruijun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A relation-aware representation approach for the question matching system</atitle><jtitle>World wide web (Bussum)</jtitle><stitle>World Wide Web</stitle><date>2024-03-01</date><risdate>2024</risdate><volume>27</volume><issue>2</issue><spage>17</spage><pages>17-</pages><artnum>17</artnum><issn>1386-145X</issn><eissn>1573-1413</eissn><abstract>Online question matching is the process of comparing user queries with system questions to find appropriate answers. This task has become increasingly important with the popularity of knowledge sharing social networks in product search and intelligent Q &A in customer service. Many previous studies have focused on designing complex semantic structures through the questions themselves. In fact, the online user’s queries accumulate a large number of similar sentences, which have been grouped by semantics in the retrieval system. However, how to use these sentences to enhance the understanding of system questions is rarely studied. In this paper, we propose a novel Relation-aware Semantic Enhancement Network (RSEN) model. Specifically, we leverage the labels of the history records to identify different semantically related sentences. Then, we construct an expanded relation network to integrate the representation of different semantic relations. Furthermore, we interact we integrate the features of the system question with the semantically related sentences to augment the semantic information. Finally, we evaluate our proposed RSEN on two publicly available datasets. The results demonstrate the effectiveness of our proposed RSEN method compared to the advanced baselines.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11280-024-01255-6</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1386-145X |
ispartof | World wide web (Bussum), 2024-03, Vol.27 (2), p.17, Article 17 |
issn | 1386-145X 1573-1413 |
language | eng |
recordid | cdi_proquest_journals_2931871016 |
source | SpringerLink Journals |
subjects | Computer Science Customer services Database Management Information Systems Applications (incl.Internet) Matching Operating Systems Query processing Questions Representations Semantics Sentences Social networks |
title | A relation-aware representation approach for the question matching system |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T06%3A05%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20relation-aware%20representation%20approach%20for%20the%20question%20matching%20system&rft.jtitle=World%20wide%20web%20(Bussum)&rft.au=Chen,%20Yanmin&rft.date=2024-03-01&rft.volume=27&rft.issue=2&rft.spage=17&rft.pages=17-&rft.artnum=17&rft.issn=1386-145X&rft.eissn=1573-1413&rft_id=info:doi/10.1007/s11280-024-01255-6&rft_dat=%3Cproquest_cross%3E2931871016%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2931871016&rft_id=info:pmid/&rfr_iscdi=true |