Graph-of-Tweets: A Graph Merging Approach to Sub-event Identification
Graph structures are powerful tools for modeling the relationships between textual elements. Graph-of-Words (GoW) has been adopted in many Natural Language tasks to encode the association between terms. However, GoW provides few document-level relationships in cases when the connections between docu...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Jing, Xiaonan Rayz, Julia Taylor |
description | Graph structures are powerful tools for modeling the relationships between
textual elements. Graph-of-Words (GoW) has been adopted in many Natural
Language tasks to encode the association between terms. However, GoW provides
few document-level relationships in cases when the connections between
documents are also essential. For identifying sub-events on social media like
Twitter, features from both word- and document-level can be useful as they
supply different information of the event. We propose a hybrid Graph-of-Tweets
(GoT) model which combines the word- and document-level structures for modeling
Tweets. To compress large amount of raw data, we propose a graph merging method
which utilizes FastText word embeddings to reduce the GoW. Furthermore, we
present a novel method to construct GoT with the reduced GoW and a Mutual
Information (MI) measure. Finally, we identify maximal cliques to extract
popular sub-events. Our model showed promising results on condensing
lexical-level information and capturing keywords of sub-events. |
doi_str_mv | 10.48550/arxiv.2101.03208 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2101_03208</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2101_03208</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-9890ef3644727f6069c9bd87ab47223bcbfb852e36ba84434d5c8ea81e07c4923</originalsourceid><addsrcrecordid>eNotj71OwzAURr0woMIDMOEXcHBsxz_doqqUSq0YyB5dO9etJZpEbijw9pTA8n3SGY50CHkoeaFsVfEnyF_pUoiSlwWXgttbst5kGI9siKz5RJzOS1rTGdE95kPqD7QexzxAONJpoG8fnuEF-4luu-ummAJMaejvyE2E9zPe__-CNM_rZvXCdq-b7areMdDGMmcdxyi1UkaYqLl2wfnOGvBXIKQPPnpbCZTag1VKqq4KFsGWyE1QTsgFefzTzh3tmNMJ8nf729POPfIH2vhEVQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Graph-of-Tweets: A Graph Merging Approach to Sub-event Identification</title><source>arXiv.org</source><creator>Jing, Xiaonan ; Rayz, Julia Taylor</creator><creatorcontrib>Jing, Xiaonan ; Rayz, Julia Taylor</creatorcontrib><description>Graph structures are powerful tools for modeling the relationships between
textual elements. Graph-of-Words (GoW) has been adopted in many Natural
Language tasks to encode the association between terms. However, GoW provides
few document-level relationships in cases when the connections between
documents are also essential. For identifying sub-events on social media like
Twitter, features from both word- and document-level can be useful as they
supply different information of the event. We propose a hybrid Graph-of-Tweets
(GoT) model which combines the word- and document-level structures for modeling
Tweets. To compress large amount of raw data, we propose a graph merging method
which utilizes FastText word embeddings to reduce the GoW. Furthermore, we
present a novel method to construct GoT with the reduced GoW and a Mutual
Information (MI) measure. Finally, we identify maximal cliques to extract
popular sub-events. Our model showed promising results on condensing
lexical-level information and capturing keywords of sub-events.</description><identifier>DOI: 10.48550/arxiv.2101.03208</identifier><language>eng</language><subject>Computer Science - Artificial Intelligence ; Computer Science - Computation and Language</subject><creationdate>2021-01</creationdate><rights>http://creativecommons.org/licenses/by-nc-nd/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2101.03208$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2101.03208$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Jing, Xiaonan</creatorcontrib><creatorcontrib>Rayz, Julia Taylor</creatorcontrib><title>Graph-of-Tweets: A Graph Merging Approach to Sub-event Identification</title><description>Graph structures are powerful tools for modeling the relationships between
textual elements. Graph-of-Words (GoW) has been adopted in many Natural
Language tasks to encode the association between terms. However, GoW provides
few document-level relationships in cases when the connections between
documents are also essential. For identifying sub-events on social media like
Twitter, features from both word- and document-level can be useful as they
supply different information of the event. We propose a hybrid Graph-of-Tweets
(GoT) model which combines the word- and document-level structures for modeling
Tweets. To compress large amount of raw data, we propose a graph merging method
which utilizes FastText word embeddings to reduce the GoW. Furthermore, we
present a novel method to construct GoT with the reduced GoW and a Mutual
Information (MI) measure. Finally, we identify maximal cliques to extract
popular sub-events. Our model showed promising results on condensing
lexical-level information and capturing keywords of sub-events.</description><subject>Computer Science - Artificial Intelligence</subject><subject>Computer Science - Computation and Language</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj71OwzAURr0woMIDMOEXcHBsxz_doqqUSq0YyB5dO9etJZpEbijw9pTA8n3SGY50CHkoeaFsVfEnyF_pUoiSlwWXgttbst5kGI9siKz5RJzOS1rTGdE95kPqD7QexzxAONJpoG8fnuEF-4luu-ummAJMaejvyE2E9zPe__-CNM_rZvXCdq-b7areMdDGMmcdxyi1UkaYqLl2wfnOGvBXIKQPPnpbCZTag1VKqq4KFsGWyE1QTsgFefzTzh3tmNMJ8nf729POPfIH2vhEVQ</recordid><startdate>20210108</startdate><enddate>20210108</enddate><creator>Jing, Xiaonan</creator><creator>Rayz, Julia Taylor</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20210108</creationdate><title>Graph-of-Tweets: A Graph Merging Approach to Sub-event Identification</title><author>Jing, Xiaonan ; Rayz, Julia Taylor</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-9890ef3644727f6069c9bd87ab47223bcbfb852e36ba84434d5c8ea81e07c4923</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Artificial Intelligence</topic><topic>Computer Science - Computation and Language</topic><toplevel>online_resources</toplevel><creatorcontrib>Jing, Xiaonan</creatorcontrib><creatorcontrib>Rayz, Julia Taylor</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jing, Xiaonan</au><au>Rayz, Julia Taylor</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Graph-of-Tweets: A Graph Merging Approach to Sub-event Identification</atitle><date>2021-01-08</date><risdate>2021</risdate><abstract>Graph structures are powerful tools for modeling the relationships between
textual elements. Graph-of-Words (GoW) has been adopted in many Natural
Language tasks to encode the association between terms. However, GoW provides
few document-level relationships in cases when the connections between
documents are also essential. For identifying sub-events on social media like
Twitter, features from both word- and document-level can be useful as they
supply different information of the event. We propose a hybrid Graph-of-Tweets
(GoT) model which combines the word- and document-level structures for modeling
Tweets. To compress large amount of raw data, we propose a graph merging method
which utilizes FastText word embeddings to reduce the GoW. Furthermore, we
present a novel method to construct GoT with the reduced GoW and a Mutual
Information (MI) measure. Finally, we identify maximal cliques to extract
popular sub-events. Our model showed promising results on condensing
lexical-level information and capturing keywords of sub-events.</abstract><doi>10.48550/arxiv.2101.03208</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2101.03208 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2101_03208 |
source | arXiv.org |
subjects | Computer Science - Artificial Intelligence Computer Science - Computation and Language |
title | Graph-of-Tweets: A Graph Merging Approach to Sub-event Identification |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T11%3A03%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Graph-of-Tweets:%20A%20Graph%20Merging%20Approach%20to%20Sub-event%20Identification&rft.au=Jing,%20Xiaonan&rft.date=2021-01-08&rft_id=info:doi/10.48550/arxiv.2101.03208&rft_dat=%3Carxiv_GOX%3E2101_03208%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |