Opinion mining using ensemble text hidden Markov models for text classification
•Proposed a new sentiment analysis method, based on text-based hidden Markov models, that uses word orders without the need of sentiment lexicons.•Proposed an ensemble of text-based hidden Markov models using boosting and clusters of words produced by latent semantic analysis.•Showed the method has...
Gespeichert in:
Veröffentlicht in: | Expert systems with applications 2018-03, Vol.94, p.218-227 |
---|---|
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 | 227 |
---|---|
container_issue | |
container_start_page | 218 |
container_title | Expert systems with applications |
container_volume | 94 |
creator | Kang, Mangi Ahn, Jaelim Lee, Kichun |
description | •Proposed a new sentiment analysis method, based on text-based hidden Markov models, that uses word orders without the need of sentiment lexicons.•Proposed an ensemble of text-based hidden Markov models using boosting and clusters of words produced by latent semantic analysis.•Showed the method has potential to classify implicit opinions by the proposed ensemble method.•Showed better performance in comparison to several previous algorithms in several datasets.•Applied it to a real-life dataset to classify paper titles.
With the rapid growth of social media, text mining is extensively utilized in practical fields, and opinion mining, also known as sentiment analysis, plays an important role in analyzing opinion and sentiment in texts. Methods in opinion mining generally depend on a sentiment lexicon, which is a set of predefined key words that express sentiment. Opinion mining requires proper sentiment words to be extracted in advance and has difficulty classifying sentences that imply an opinion without using any sentiment key words. This paper presents a new sentiment analysis method, based on text-based hidden Markov models (TextHMMs), for text classification that uses a sequence of words in training texts instead of a predefined sentiment lexicon. We sought to learn text patterns representing sentiment through ensemble TextHMMs. Our method defines hidden variables in TextHMMs by semantic cluster information in consideration of the co-occurrence of words, and thus calculates the sentiment orientation of sentences by fitted TextHMMs. To reflect diverse patterns, we applied an ensemble of TextHMM-based classifiers. In the experiments with a benchmark data set, we show that this method is superior to some existing methods and particularly has potential to classify implicit opinions. We also demonstrate the practicality of the proposed method in a real-life data set of online market reviews. |
doi_str_mv | 10.1016/j.eswa.2017.07.019 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1990825192</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0957417417304979</els_id><sourcerecordid>1990825192</sourcerecordid><originalsourceid>FETCH-LOGICAL-c328t-c3ea67b5663cbbc6aa3fd568a97578ec1e1a7fdc5d623defb6922c545b97fbe03</originalsourceid><addsrcrecordid>eNp9UE1LxDAUDKLguvoHPBU8tybpJmnAiyx-wcpe9BzS5FVT22ZNuqv-e1PqWRjmHd7MPN4gdElwQTDh120B8UsXFBNR4AQij9CCVKLMuZDlMVpgyUS-ImJ1is5ibHESYiwWaLvducH5IevTGN6yfZwYhgh93UE2wveYvTtrYciedfjwh6z3FrqYNT7MW9PpGF3jjB5Tzjk6aXQX4eJvLtHr_d3L-jHfbB-e1reb3JS0GhOD5qJmnJemrg3Xumws45WWgokKDAGiRWMNs5yWFpqaS0oNW7FaiqYGXC7R1Zy7C_5zD3FUrd-HIZ1UREpcUUYkTSo6q0zwMQZo1C64XocfRbCailOtmopTU3EKJxCZTDezKb0JBwdBReNgMGBdADMq691_9l_KfXiX</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1990825192</pqid></control><display><type>article</type><title>Opinion mining using ensemble text hidden Markov models for text classification</title><source>Elsevier ScienceDirect Journals</source><creator>Kang, Mangi ; Ahn, Jaelim ; Lee, Kichun</creator><creatorcontrib>Kang, Mangi ; Ahn, Jaelim ; Lee, Kichun</creatorcontrib><description>•Proposed a new sentiment analysis method, based on text-based hidden Markov models, that uses word orders without the need of sentiment lexicons.•Proposed an ensemble of text-based hidden Markov models using boosting and clusters of words produced by latent semantic analysis.•Showed the method has potential to classify implicit opinions by the proposed ensemble method.•Showed better performance in comparison to several previous algorithms in several datasets.•Applied it to a real-life dataset to classify paper titles.
With the rapid growth of social media, text mining is extensively utilized in practical fields, and opinion mining, also known as sentiment analysis, plays an important role in analyzing opinion and sentiment in texts. Methods in opinion mining generally depend on a sentiment lexicon, which is a set of predefined key words that express sentiment. Opinion mining requires proper sentiment words to be extracted in advance and has difficulty classifying sentences that imply an opinion without using any sentiment key words. This paper presents a new sentiment analysis method, based on text-based hidden Markov models (TextHMMs), for text classification that uses a sequence of words in training texts instead of a predefined sentiment lexicon. We sought to learn text patterns representing sentiment through ensemble TextHMMs. Our method defines hidden variables in TextHMMs by semantic cluster information in consideration of the co-occurrence of words, and thus calculates the sentiment orientation of sentences by fitted TextHMMs. To reflect diverse patterns, we applied an ensemble of TextHMM-based classifiers. In the experiments with a benchmark data set, we show that this method is superior to some existing methods and particularly has potential to classify implicit opinions. We also demonstrate the practicality of the proposed method in a real-life data set of online market reviews.</description><identifier>ISSN: 0957-4174</identifier><identifier>EISSN: 1873-6793</identifier><identifier>DOI: 10.1016/j.eswa.2017.07.019</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Boosting ; Classification ; Clustering ; Data mining ; Datasets ; Digital media ; Ensemble ; Hidden Markov models ; Markov analysis ; Markov chains ; Opinion mining ; Sentences ; Sentiment analysis ; Social networks ; Studies ; Texts</subject><ispartof>Expert systems with applications, 2018-03, Vol.94, p.218-227</ispartof><rights>2017 Elsevier Ltd</rights><rights>Copyright Elsevier BV Mar 15, 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c328t-c3ea67b5663cbbc6aa3fd568a97578ec1e1a7fdc5d623defb6922c545b97fbe03</citedby><cites>FETCH-LOGICAL-c328t-c3ea67b5663cbbc6aa3fd568a97578ec1e1a7fdc5d623defb6922c545b97fbe03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0957417417304979$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids></links><search><creatorcontrib>Kang, Mangi</creatorcontrib><creatorcontrib>Ahn, Jaelim</creatorcontrib><creatorcontrib>Lee, Kichun</creatorcontrib><title>Opinion mining using ensemble text hidden Markov models for text classification</title><title>Expert systems with applications</title><description>•Proposed a new sentiment analysis method, based on text-based hidden Markov models, that uses word orders without the need of sentiment lexicons.•Proposed an ensemble of text-based hidden Markov models using boosting and clusters of words produced by latent semantic analysis.•Showed the method has potential to classify implicit opinions by the proposed ensemble method.•Showed better performance in comparison to several previous algorithms in several datasets.•Applied it to a real-life dataset to classify paper titles.
With the rapid growth of social media, text mining is extensively utilized in practical fields, and opinion mining, also known as sentiment analysis, plays an important role in analyzing opinion and sentiment in texts. Methods in opinion mining generally depend on a sentiment lexicon, which is a set of predefined key words that express sentiment. Opinion mining requires proper sentiment words to be extracted in advance and has difficulty classifying sentences that imply an opinion without using any sentiment key words. This paper presents a new sentiment analysis method, based on text-based hidden Markov models (TextHMMs), for text classification that uses a sequence of words in training texts instead of a predefined sentiment lexicon. We sought to learn text patterns representing sentiment through ensemble TextHMMs. Our method defines hidden variables in TextHMMs by semantic cluster information in consideration of the co-occurrence of words, and thus calculates the sentiment orientation of sentences by fitted TextHMMs. To reflect diverse patterns, we applied an ensemble of TextHMM-based classifiers. In the experiments with a benchmark data set, we show that this method is superior to some existing methods and particularly has potential to classify implicit opinions. We also demonstrate the practicality of the proposed method in a real-life data set of online market reviews.</description><subject>Boosting</subject><subject>Classification</subject><subject>Clustering</subject><subject>Data mining</subject><subject>Datasets</subject><subject>Digital media</subject><subject>Ensemble</subject><subject>Hidden Markov models</subject><subject>Markov analysis</subject><subject>Markov chains</subject><subject>Opinion mining</subject><subject>Sentences</subject><subject>Sentiment analysis</subject><subject>Social networks</subject><subject>Studies</subject><subject>Texts</subject><issn>0957-4174</issn><issn>1873-6793</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LxDAUDKLguvoHPBU8tybpJmnAiyx-wcpe9BzS5FVT22ZNuqv-e1PqWRjmHd7MPN4gdElwQTDh120B8UsXFBNR4AQij9CCVKLMuZDlMVpgyUS-ImJ1is5ibHESYiwWaLvducH5IevTGN6yfZwYhgh93UE2wveYvTtrYciedfjwh6z3FrqYNT7MW9PpGF3jjB5Tzjk6aXQX4eJvLtHr_d3L-jHfbB-e1reb3JS0GhOD5qJmnJemrg3Xumws45WWgokKDAGiRWMNs5yWFpqaS0oNW7FaiqYGXC7R1Zy7C_5zD3FUrd-HIZ1UREpcUUYkTSo6q0zwMQZo1C64XocfRbCailOtmopTU3EKJxCZTDezKb0JBwdBReNgMGBdADMq691_9l_KfXiX</recordid><startdate>20180315</startdate><enddate>20180315</enddate><creator>Kang, Mangi</creator><creator>Ahn, Jaelim</creator><creator>Lee, Kichun</creator><general>Elsevier Ltd</general><general>Elsevier BV</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>20180315</creationdate><title>Opinion mining using ensemble text hidden Markov models for text classification</title><author>Kang, Mangi ; Ahn, Jaelim ; Lee, Kichun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c328t-c3ea67b5663cbbc6aa3fd568a97578ec1e1a7fdc5d623defb6922c545b97fbe03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Boosting</topic><topic>Classification</topic><topic>Clustering</topic><topic>Data mining</topic><topic>Datasets</topic><topic>Digital media</topic><topic>Ensemble</topic><topic>Hidden Markov models</topic><topic>Markov analysis</topic><topic>Markov chains</topic><topic>Opinion mining</topic><topic>Sentences</topic><topic>Sentiment analysis</topic><topic>Social networks</topic><topic>Studies</topic><topic>Texts</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kang, Mangi</creatorcontrib><creatorcontrib>Ahn, Jaelim</creatorcontrib><creatorcontrib>Lee, Kichun</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>Expert systems with applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kang, Mangi</au><au>Ahn, Jaelim</au><au>Lee, Kichun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Opinion mining using ensemble text hidden Markov models for text classification</atitle><jtitle>Expert systems with applications</jtitle><date>2018-03-15</date><risdate>2018</risdate><volume>94</volume><spage>218</spage><epage>227</epage><pages>218-227</pages><issn>0957-4174</issn><eissn>1873-6793</eissn><abstract>•Proposed a new sentiment analysis method, based on text-based hidden Markov models, that uses word orders without the need of sentiment lexicons.•Proposed an ensemble of text-based hidden Markov models using boosting and clusters of words produced by latent semantic analysis.•Showed the method has potential to classify implicit opinions by the proposed ensemble method.•Showed better performance in comparison to several previous algorithms in several datasets.•Applied it to a real-life dataset to classify paper titles.
With the rapid growth of social media, text mining is extensively utilized in practical fields, and opinion mining, also known as sentiment analysis, plays an important role in analyzing opinion and sentiment in texts. Methods in opinion mining generally depend on a sentiment lexicon, which is a set of predefined key words that express sentiment. Opinion mining requires proper sentiment words to be extracted in advance and has difficulty classifying sentences that imply an opinion without using any sentiment key words. This paper presents a new sentiment analysis method, based on text-based hidden Markov models (TextHMMs), for text classification that uses a sequence of words in training texts instead of a predefined sentiment lexicon. We sought to learn text patterns representing sentiment through ensemble TextHMMs. Our method defines hidden variables in TextHMMs by semantic cluster information in consideration of the co-occurrence of words, and thus calculates the sentiment orientation of sentences by fitted TextHMMs. To reflect diverse patterns, we applied an ensemble of TextHMM-based classifiers. In the experiments with a benchmark data set, we show that this method is superior to some existing methods and particularly has potential to classify implicit opinions. We also demonstrate the practicality of the proposed method in a real-life data set of online market reviews.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.eswa.2017.07.019</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0957-4174 |
ispartof | Expert systems with applications, 2018-03, Vol.94, p.218-227 |
issn | 0957-4174 1873-6793 |
language | eng |
recordid | cdi_proquest_journals_1990825192 |
source | Elsevier ScienceDirect Journals |
subjects | Boosting Classification Clustering Data mining Datasets Digital media Ensemble Hidden Markov models Markov analysis Markov chains Opinion mining Sentences Sentiment analysis Social networks Studies Texts |
title | Opinion mining using ensemble text hidden Markov models for text classification |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T14%3A02%3A47IST&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=Opinion%20mining%20using%20ensemble%20text%20hidden%20Markov%20models%20for%20text%20classification&rft.jtitle=Expert%20systems%20with%20applications&rft.au=Kang,%20Mangi&rft.date=2018-03-15&rft.volume=94&rft.spage=218&rft.epage=227&rft.pages=218-227&rft.issn=0957-4174&rft.eissn=1873-6793&rft_id=info:doi/10.1016/j.eswa.2017.07.019&rft_dat=%3Cproquest_cross%3E1990825192%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=1990825192&rft_id=info:pmid/&rft_els_id=S0957417417304979&rfr_iscdi=true |