A Bipartite Graph Model and Mutually Reinforcing Analysis for Review Sites
A number of methods have been proposed for detecting spam reviews in order to obtain credible summaries. These methods, however, could not be uniformly applied to various forms of reviews and are not suitable for a product or service which has been evaluated by few reviewers. In this paper, we propo...
        Saved in:
      
    
          | Published in | Database and Expert Systems Applications pp. 341 - 348 | 
|---|---|
| Main Authors | , , , | 
| Format | Book Chapter | 
| Language | English Japanese  | 
| Published | 
        Berlin, Heidelberg
          Springer Berlin Heidelberg
    
        2011
     | 
| Series | Lecture Notes in Computer Science | 
| Subjects | |
| Online Access | Get full text | 
| ISBN | 9783642230875 3642230873  | 
| ISSN | 0302-9743 1611-3349  | 
| DOI | 10.1007/978-3-642-23088-2_25 | 
Cover
| Summary: | A number of methods have been proposed for detecting spam reviews in order to obtain credible summaries. These methods, however, could not be uniformly applied to various forms of reviews and are not suitable for a product or service which has been evaluated by few reviewers. In this paper, we propose a bipartite graph model of review sites and a mutually reinforcing method of summarizing evaluations and detecting anomalous reviewers. Our model and method can be applied to reviews of various forms, and is suitable for a subject with few reviewers. We ascertain the effectiveness of our method using reviews of three forms on Yahoo! Movie web site. | 
|---|---|
| ISBN: | 9783642230875 3642230873  | 
| ISSN: | 0302-9743 1611-3349  | 
| DOI: | 10.1007/978-3-642-23088-2_25 |