Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Review Selection Using Micro-Reviews

Published: 01 April 2015 Publication History

Abstract

Given the proliferation of review content, and the fact that reviews are highly diverse and often unnecessarily verbose, users frequently face the problem of selecting the appropriate reviews to consume. Micro-reviews are emerging as a new type of online review content in the social media. Micro-reviews are posted by users of check-in services such as Foursquare. They are concise (up to 200 characters long) and highly focused, in contrast to the comprehensive and verbose reviews. In this paper, we propose a novel mining problem, which brings together these two disparate sources of review content. Specifically, we use coverage of micro-reviews as an objective for selecting a set of reviews that cover efficiently the salient aspects of an entity. Our approach consists of a two-step process: matching review sentences to micro-reviews, and selecting a small set of reviews that cover as many micro-reviews as possible, with few sentences. We formulate this objective as a combinatorial optimization problem, and show how to derive an optimal solution using Integer Linear Programming. We also propose an efficient heuristic algorithm that approximates the optimal solution. Finally, we perform a detailed evaluation of all the steps of our methodology using data collected from Foursquare and Yelp.

References

[1]
D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent Dirichlet allocation,” J. Mach. Learn. Res., vol. 3, pp. 993–1022, 2003.
[2]
R. D. Carr, S. Doddi, G. Konjevod, and M. V. Marathe, “On the red-blue set cover problem,” in Proc. 11th Annu. ACM-SIAM Symp. Discrete Algorithm, 2000, pp. 345–353.
[3]
C. Cheng, H. Yang, I. King, and M. R. Lyu, “Fused matrix factorization with geographical and social influence in location-based social networks,” in Proc. 26th AAAI Conf. Artif. Intell., 2012, p. 1.
[4]
K. Ganesan, C. Zhai, and J. Han, “Opinosis: A graph-based approach to abstractive summarization of highly redundant opinions,” in Proc. 23rd Int. Conf. Comput. Linguistics, 2010, pp. 340–348.
[5]
K. Ganesan, C. Zhai, and E. Viegas, “Micropinion generation: An unsupervised approach to generating ultra-concise summaries of opinions,” in Proc. 21st Int. Conf. World Wide Web, 2012, pp. 869–878.
[6]
H. Gao, J. Tang, X. Hu, and H. Liu, “Exploring temporal effects for location recommendation on location-based social networks,” in Proc. 7th ACM Conf. Recommender Syst., 2013, pp. 93–100.
[7]
A. Ghose and P. G. Ipeirotis, “Designing novel review ranking systems: Predicting the usefulness and impact of reviews,” in Proc. 9th Int. Conf. Electron. Commerce, 2007, pp. 303–310.
[8]
M. Hu and B. Liu, “ Mining and summarizing customer reviews,” in Proc. 10th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2004, pp. 168–177.
[9]
B. J. Jansen, M. Zhang, K. Sobel, and A. Chowdury, “Twitter power: Tweets as electronic word of mouth,” J. Amer. Soc. Inf. Sci. Technol., vol. 60, no. 11, pp. 2169–2188, 2009.
[10]
S. Khuller, A. Moss, and J. S. Naor, “The budgeted maximum coverage problem,” Inf. Process. Lett., vol. 70, no. 1, pp. 39–45, 1999.
[11]
S.-M. Kim, P. Pantel, T. Chklovski, and M. Pennacchiotti, “Automatically assessing review helpfulness,” in Proc. Conf. Empirical Methods Natural Lang. Process., 2006, pp. 423–430.
[12]
E. Kouloumpis, T. Wilson, and J. Moore, “Twitter sentiment analysis: The good the bad and the omg,” in Proc. 5th Int. Conf. Weblogs Social Media, 2011, pp. 538–541.
[13]
T. Lappas, M. Crovella, and E. Terzi, “Selecting a characteristic set of reviews,” in Proc. 18th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2012, pp. 832–840.
[14]
T. Lappas and D. Gunopulos, “Efficient confident search in large review corpora,” in Proc. Eur. Conf. Mach. Learn. knowl. Discovery Databases: Part II, 2010, pp. 195– 210.
[15]
H. Lin and J. Bilmes, “ Multi-document summarization via budgeted maximization of submodular functions,” in Proc. Human Lang. Technol.: Annu. Conf. North Amer. Chapter Assoc. Comput. Linguistics, 2010, pp. 912–920.
[16]
Y. Liu, X. Huang, A. An, and X. Yu, “Modeling and predicting the helpfulness of online reviews,” in Proc. 8th Int. Conf. Data Mining, 2008, pp. 443 –452.
[17]
Y. Lu, P. Tsaparas, A. Ntoulas, and L. Polanyi, “Exploiting social context for review quality prediction,” in Proc. 19th Int. Conf. World Wide Web, 2010, pp. 691–700.
[18]
Y. Lu, C. Zhai, and N. Sundaresan, “Rated aspect summarization of short comments,” in Proc. 18th Int. Conf. World Wide Web, 2009, pp. 131–140.
[19]
C. Manning and D. Klein, “Optimization, maxent models, and conditional estimation without magic,” in Proc. Conf. North Amer. Chapter Assoc. Comput. Linguistics Human Lang. Technol.: Tuts., 2003, vol. 5, p. 8.
[20]
C. D. Manning and H. Schütze, Foundations of Statistical Natural Language Processing. Cambridge, MA, USA: MIT Press, 1999.
[21]
A. K. McCallum. (2002). Mallet: A machine learning for language toolkit [Online]. Available: http://mallet.cs.umass.edu
[22]
X. Meng and H. Wang, “Mining user reviews: From specification to summarization,” in Proc. ACL-IJCNLP Conf. Short Papers, 2009, pp. 177–180.
[23]
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, “An analysis of approximations for maximizing submodular set functions-I,” Math. Programm. , vol. 14, no. 1, pp. 265–294, 1978.
[24]
A. Noulas, S. Scellato, C. Mascolo, and M. Pontil, “An empirical study of geographic user activity patterns in foursquare,” in Proc. 5th Int. AAAI Conf. Weblogs Social Media , 2011, pp. 570–573.
[25]
B. Pang, L. Lee, and S. Vaithyanathan, “ Thumbs up?: Sentiment classification using machine learning techniques,” in Proc. ACL-02 Conf. Empirical Methods Natural Lang. Process., 2002, pp. 79–86.
[26]
D. Peleg, “Approximation algorithms for the label-coverMAX and Red-Blue set cover problems,” J. Discrete Algorithms, vol. 5, no. 1, pp. 55–64, 2007.
[27]
T. Pontes, M. Vasconcelos, J. Almeida, P. Kumaraguru, and V. Almeida, “We know where you live: privacy characterization of foursquare behavior,” in Proc. ACM Conf. Ubiquitous Comput., 2012, pp. 898–905.
[28]
P. Sinha, S. Mehrotra, and R. Jain, “Summarization of personal photologs using multidimensional content and context,” in Proc. 1st ACM Int. Conf. Multimedia Retrieval, 2011, p. 4.
[29]
P. Tsaparas, A. Ntoulas, and E. Terzi, “Selecting a comprehensive set of reviews,” in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2011, pp. 168–176.
[30]
M. A. Vasconcelos, S. Ricci, J. Almeida, F. Benevenuto, and V. Almeida, “Tips, dones and todos: Uncovering user profiles in foursquare,” in Proc. 5th ACM Int. Conf. Web Search Data Mining, 2012, pp. 653–662.
[31]
V. V. Vazirani, Approximation Algorithms. New York, NY, USA : Springer, 2004.
[32]
W. Yu, R. Zhang, X. He, and C. Sha, “Selecting a diversified set of reviews,” in Proc. 15th Asia-Pacific Web Conf., 2013, pp. 721– 733.
[33]
Q. Yuan, G. Cong, Z. Ma, A. Sun, and N. M. Thalmann, “Time-aware point-of-interest recommendation,” in Proc. 36th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2013, pp. 363– 372.
[34]
L. Zhuang, F. Jing, and X.-Y. Zhu, “Movie review mining and summarization,” in Proc. 15th ACM Int. Conf. Inf. knowl. Manage. , 2006, pp. 43–50.

Cited By

View all
  • (2023)A Review Selection Method Based on Consumer Decision Phases in E-commerceACM Transactions on Information Systems10.1145/358726542:1(1-27)Online publication date: 30-Mar-2023
  • (2021)A Review Selection Method for Finding an Informative Subset from Online ReviewsINFORMS Journal on Computing10.1287/ijoc.2019.095033:1(280-299)Online publication date: 1-Jan-2021
  • (2019)Effective Selection of a Compact and High-Quality Review Set with Information PreservationACM Transactions on Management Information Systems10.1145/336939510:4(1-22)Online publication date: 10-Dec-2019

Index Terms

  1. Review Selection Using Micro-Reviews
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Knowledge and Data Engineering
    IEEE Transactions on Knowledge and Data Engineering  Volume 27, Issue 4
    April 2015
    274 pages

    Publisher

    IEEE Educational Activities Department

    United States

    Publication History

    Published: 01 April 2015

    Author Tags

    1. coverage
    2. Micro-review
    3. review selection

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 04 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)A Review Selection Method Based on Consumer Decision Phases in E-commerceACM Transactions on Information Systems10.1145/358726542:1(1-27)Online publication date: 30-Mar-2023
    • (2021)A Review Selection Method for Finding an Informative Subset from Online ReviewsINFORMS Journal on Computing10.1287/ijoc.2019.095033:1(280-299)Online publication date: 1-Jan-2021
    • (2019)Effective Selection of a Compact and High-Quality Review Set with Information PreservationACM Transactions on Management Information Systems10.1145/336939510:4(1-22)Online publication date: 10-Dec-2019

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media