Name
Abstract | ||
|---|---|---|
Seed sets are of significant importance for trust propagation based anti-spamming algorithms, e.g., TrustRank. Conventional approaches require manual evaluation to construct a seed set, which restricts the seed set to be small in size, since it would cost too much and may even be impossible to construct a very large seed set manually. The small-sized seed set can cause detrimental effect on the final ranking results. Thus, it is desirable to automatically expand an initial seed set to a much larger one. In this paper, we propose the first automatic seed set expansion algorithm (ASE), which expands a small seed set by selecting reputable seeds that are found and guaranteed to be reputable through a joint recommendation link structure. Experimental results on the WEBSPAM-2007 dataset show that with the same manual evaluation efforts, ASE can automatically obtain a large number of reputable seeds with high precision, thus significantly improving the performance of the baseline algorithm in terms of both reputable site promotion and spam site demotion. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.ins.2012.12.035 | Information Sciences |
Keywords | Field | DocType |
initial seed,baseline algorithm,reputable site promotion,seed set,large seed,trust propagation,automatic seed set expansion,large number,small-sized seed set,reputable seed,small seed,link analysis,spam | Data mining,Demotion,Ranking,TrustRank,Computer science,Link analysis,Algorithm,Set expansion,Artificial intelligence,Initial Seed,Machine learning,Spamming | Conference |
Volume | Issue | ISSN |
232 | null | null |
Citations | PageRank | References |
12 | 0.58 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xianchao Zhang | 1 | 313 | 39.57 |
| Bo Han | 2 | 593 | 29.85 |
| Wenxin Liang | 3 | 140 | 17.03 |