-
1
-
-
38149065553
-
-
submitted
-
Andersen, R., Borgs, C., Chayes, J., Hopcroft, J., Jain, K., Mirrokni, V., Teng, S.: Experimental evaluation of locally computable link-spam features (submitted, 2007)
-
(2007)
Experimental evaluation of locally computable link-spam features
-
-
Andersen, R.1
Borgs, C.2
Chayes, J.3
Hopcroft, J.4
Jain, K.5
Mirrokni, V.6
Teng, S.7
-
2
-
-
38749085661
-
Local graph partitioning using pagerank vectors
-
IEEE Computer Society, Washington, DC
-
Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475-486. IEEE Computer Society, Washington, DC (2006)
-
(2006)
FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
, pp. 475-486
-
-
Andersen, R.1
Chung, F.2
Lang, K.3
-
3
-
-
38149106085
-
-
Becchetti, L., Castillo, C., Donato, D., Leonardi, S., Baeza-Yates, R.: Link-based characterization and detection of web spam (2006)
-
(2006)
Link-based characterization and detection of web spam
-
-
Becchetti, L.1
Castillo, C.2
Donato, D.3
Leonardi, S.4
Baeza-Yates, R.5
-
4
-
-
34250660925
-
Spamrarik - fully automatic link spam detection
-
Benczúr, A.A., Csalogány, K., Sarlós, T., Uher, M.: Spamrarik - fully automatic link spam detection. In: First International Workshop on Adversarial Information Retrieval on the Web (2005)
-
(2005)
First International Workshop on Adversarial Information Retrieval on the Web
-
-
Benczúr, A.A.1
Csalogány, K.2
Sarlós, T.3
Uher, M.4
-
5
-
-
84924195580
-
Bookmark-coloring algorithm for personalized pagerank computing
-
Berkhin, P.: Bookmark-coloring algorithm for personalized pagerank computing. Internet Math. 3(1), 41-62 (2006)
-
(2006)
Internet Math
, vol.3
, Issue.1
, pp. 41-62
-
-
Berkhin, P.1
-
6
-
-
0038589165
-
The anatomy of a large-scale hypertextual Web search engine
-
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1-7), 107-117 (1998)
-
(1998)
Computer Networks and ISDN Systems
, vol.30
, Issue.1-7
, pp. 107-117
-
-
Brin, S.1
Page, L.2
-
7
-
-
18744409364
-
Local methods for estimating pagerank values
-
Chen, Y., Gan, Q., Suei, T.: Local methods for estimating pagerank values. In: Proc. of CIKM, pp. 381-389 (2004)
-
(2004)
Proc. of CIKM
, pp. 381-389
-
-
Chen, Y.1
Gan, Q.2
Suei, T.3
-
8
-
-
77954428596
-
Spam, damn spam, and statistics: Using statistical analysis to locate spam web
-
ACM Press, New York
-
Fetterly, D., Manasse, M., Najork, M.: Spam, damn spam, and statistics: using statistical analysis to locate spam web pages. In: WebDB 2004: Proceedings of the 7th International Workshop on the Web and Databases, pp. 1-6. ACM Press, New York (2004)
-
(2004)
WebDB 2004: Proceedings of the 7th International Workshop on the Web and Databases
, pp. 1-6
-
-
Fetterly, D.1
Manasse, M.2
Najork, M.3
-
9
-
-
35048902592
-
-
Fogaras, D., Racz, B.: Towards scaling fully personalized pagerank. In: Leonardi, S. (ed.) WAW 2004. LNCS, 3243, pp. 105-117. Springer, Heidelberg (2004)
-
Fogaras, D., Racz, B.: Towards scaling fully personalized pagerank. In: Leonardi, S. (ed.) WAW 2004. LNCS, vol. 3243, pp. 105-117. Springer, Heidelberg (2004)
-
-
-
-
10
-
-
34548764345
-
Link spam detection based on mass estimation
-
ACM, New York
-
Gyöngyi, Z., Berkhin, P., Garcia-Molina, H., Pedersen, J.: Link spam detection based on mass estimation. In: Proceedings of the 32nd International Conference on Very Large Databases, ACM, New York (2006)
-
(2006)
Proceedings of the 32nd International Conference on Very Large Databases
-
-
Gyöngyi, Z.1
Berkhin, P.2
Garcia-Molina, H.3
Pedersen, J.4
-
11
-
-
85131818719
-
Combating web spam with trustrank
-
Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with trustrank. In: VLDB, pp. 576-587 (2004)
-
(2004)
VLDB
, pp. 576-587
-
-
Gyöngyi, Z.1
Garcia-Molina, H.2
Pedersen, J.3
-
12
-
-
38149029726
-
-
Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.: Web content categorization using link information. Technical report, Stanford University (2006)
-
Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.: Web content categorization using link information. Technical report, Stanford University (2006)
-
-
-
-
13
-
-
0041848443
-
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
-
Haveliwala, T.H.: Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng. 15(4), 784-796 (2003)
-
(2003)
IEEE Trans. Knowl. Data Eng
, vol.15
, Issue.4
, pp. 784-796
-
-
Haveliwala, T.H.1
-
16
-
-
0011716017
-
What can be computed locally?
-
Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. Comput. 24(6), 1259-1277 (1995)
-
(1995)
SIAM J. Comput
, vol.24
, Issue.6
, pp. 1259-1277
-
-
Naor, M.1
Stockmeyer, L.2
-
17
-
-
34250653315
-
-
Ntoulas, A., Najork, M., Manasse, M., Fetterly, D.: Detecting spam web pages through content analysis. In: WWW 2006: Proceedings of the 15th international conference on World Wide Web, pp. 83-92. ACM Press, New York (2006)
-
Ntoulas, A., Najork, M., Manasse, M., Fetterly, D.: Detecting spam web pages through content analysis. In: WWW 2006: Proceedings of the 15th international conference on World Wide Web, pp. 83-92. ACM Press, New York (2006)
-
-
-
-
19
-
-
34250637587
-
-
Sarlós, T., Benczúr, A.A., Csalogány, K., Fogaras, D.: To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: WWW, pp. 297-306 (2006)
-
Sarlós, T., Benczúr, A.A., Csalogány, K., Fogaras, D.: To randomize or not to randomize: space optimal summaries for hyperlink analysis. In: WWW, pp. 297-306 (2006)
-
-
-
-
20
-
-
4544280485
-
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
-
ACM Press, New York
-
Spielman, D.A., Teng, S.-H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: ACM STOC-04, pp. 81-90. ACM Press, New York (2004)
-
(2004)
ACM STOC-04
, pp. 81-90
-
-
Spielman, D.A.1
Teng, S.-H.2
|