메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1332-1341

Structural opinion mining for graph-based sentiment representation

Author keywords

[No Author keywords available]

Indexed keywords

CHINESE CORPUS; EXPERIMENTAL EVALUATION; FEATURE-BASED; GRAPH REPRESENTATION; GRAPH-BASED; GRAPH-BASED REPRESENTATIONS; OPINION MINING; SENTENCE LEVEL; STRUCTURAL LEARNING;

EID: 80053233135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (31)

References (22)
  • 2
    • 85048736608 scopus 로고    scopus 로고
    • Mine the easy, classify the hard: A semi-supervised approach to automatic sentiment classification
    • Sajib Dasgupta and Vincent Ng. 2009. Mine the easy, classify the hard: A semi-supervised approach to automatic sentiment classification. In Proceedings of ACL-IJCNLP.
    • (2009) Proceedings of ACL-IJCNLP
    • Dasgupta, S.1    Ng, V.2
  • 3
    • 9444244198 scopus 로고    scopus 로고
    • Mining the peanut gallery: Opinion extraction and semantic classification of product reviews
    • Kushal Dave, Steve Lawrence, and David M. Pennock. 2003. Mining the peanut gallery: opinion extraction and semantic classification of product reviews. In Proceedings of WWW.
    • (2003) Proceedings of WWW
    • Dave, K.1    Lawrence, S.2    Pennock, D.M.3
  • 4
    • 84858428184 scopus 로고    scopus 로고
    • Joint determination of anaphoricity and coreference resolution using integer programming
    • Pascal Denis and Jason Baldridge. 2007. Joint determination of anaphoricity and coreference resolution using integer programming. In Proceedings of NAACL-HLT.
    • (2007) Proceedings of NAACL-HLT
    • Denis, P.1    Baldridge, J.2
  • 5
    • 79961078875 scopus 로고    scopus 로고
    • Identifying text polarity using random walks
    • Uppsala, Sweden, July. Association for Computational Linguistics
    • Ahmed Hassan and Dragomir R. Radev. 2010. Identifying text polarity using random walks. In Proceedings of ACL, pages 395-403, Uppsala, Sweden, July. Association for Computational Linguistics.
    • (2010) Proceedings of ACL , pp. 395-403
    • Hassan, A.1    Radev, D.R.2
  • 6
    • 12244305149 scopus 로고    scopus 로고
    • Mining and summarizing customer reviews
    • Minqing Hu and Bing Liu. 2004. Mining and summarizing customer reviews. In Proceedings of SIGKDD.
    • (2004) Proceedings of SIGKDD
    • Hu, M.1    Liu, B.2
  • 7
    • 33750308486 scopus 로고    scopus 로고
    • Identifying comparative sentences in text documents
    • Nitin Jindal and Bing Liu. 2006. Identifying comparative sentences in text documents. In Proceedings of SIGIR.
    • (2006) Proceedings of SIGIR
    • Jindal, N.1    Liu, B.2
  • 8
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R. Miller and J. Thatcher, editors Plenum Press
    • R. Karp. 1972. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.1
  • 9
    • 85119979467 scopus 로고    scopus 로고
    • Automatic identification of pro and con reasons in online reviews
    • Soo-Min Kim and Eduard Hovy. 2006. Automatic identification of pro and con reasons in online reviews. In Proceedings of the COLING-ACL.
    • (2006) Proceedings of the COLING-ACL
    • Kim, S.-M.1    Hovy, E.2
  • 11
    • 80053373055 scopus 로고    scopus 로고
    • Extracting aspect-evaluation and aspect-of relations in opinion mining
    • Nozomi Kobayashi, Kentaro Inui, and Yuji Matsumoto. 2007. Extracting aspect-evaluation and aspect-of relations in opinion mining. In Proceedings of EMNLP-CoNLL.
    • (2007) Proceedings of EMNLP-CoNLL
    • Kobayashi, N.1    Inui, K.2    Matsumoto, Y.3
  • 13
    • 84859887629 scopus 로고    scopus 로고
    • Concise integer linear programming formulations for dependency parsing
    • Andre Martins, Noah Smith, and Eric Xing. 2009. Concise integer linear programming formulations for dependency parsing. In Proceedings of ACL-IJCNLP.
    • (2009) Proceedings of ACL-IJCNLP
    • Martins, A.1    Smith, N.2    Xing, E.3
  • 15
    • 84876798255 scopus 로고    scopus 로고
    • Online learning of approximate dependency parsing algorithms
    • Ryan Mcdonald and Fernando Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc. of EACL, pages 81-88.
    • (2006) Proc. of EACL , pp. 81-88
    • Mcdonald, R.1    Pereira, F.2
  • 17
    • 85141803251 scopus 로고    scopus 로고
    • Thumbs up? Sentiment classification using machine learning techniques
    • Bo Pang, Lillian Lee, and Shivakumar Vaithyanathan. 2002. Thumbs up? Sentiment classification using machine learning techniques. In Proc. of EMNLP 2002.
    • (2002) Proc. of EMNLP 2002
    • Pang, B.1    Lee, L.2    Vaithyanathan, S.3
  • 18
    • 80053349723 scopus 로고    scopus 로고
    • Incremental integer linear programming for non-projective dependency parsing
    • Sebastian Riedel and James Clarke. 2006. Incremental integer linear programming for non-projective dependency parsing. In Proceedings of EMNLP.
    • (2006) Proceedings of EMNLP
    • Riedel, S.1    Clarke, J.2
  • 21
    • 84859908006 scopus 로고    scopus 로고
    • Extracting semantic orientations of words using spin model
    • Hiroya Takamura, Takashi Inui, and Manabu Okumura. 2005. Extracting semantic orientations of words using spin model. In Proceedings of ACL.
    • (2005) Proceedings of ACL
    • Takamura, H.1    Inui, T.2    Okumura, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.