![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
1st WSDM 2008: Stanford, CA, USA
- Marc Najork, Andrei Z. Broder, Soumen Chakrabarti:
Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008. ACM 2008, ISBN 978-1-59593-927-2 - Hector Garcia-Molina:
Web information management: past, present and future. 1 - Oren Etzioni:
Machine reading at web scale. 2 - Sandeep Pandey, Christopher Olston:
Crawl ordering by search impact. 3-14 - Flavio Chierichetti, Silvio Lattanzi, Federico Mari
, Alessandro Panconesi:
On placing skips optimally in expectation. 15-24 - Navin Goyal, Yury Lifshits, Hinrich Schütze:
Disorder inequality: a combinatorial approach to nearest neighbor search. 25-32 - Ori Ben-Yitzhak, Nadav Golbandi, Nadav Har'El, Ronny Lempel, Andreas Neumann, Shila Ofek-Koifman, Dafna Sheinwald, Eugene J. Shekita, Benjamin Sznajder, Sivan Yogev:
Beyond basic faceted search. 33-44 - Qiaozhu Mei, Kenneth Ward Church:
Entropy of search logs: how hard is search? with personalization? with backoff? 45-54 - Jonathan L. Elsas, Vitor R. Carvalho, Jaime G. Carbonell:
Fast learning of document ranking functions with the committee perceptron. 55-64 - Mark R. Meiss, Filippo Menczer, Santo Fortunato, Alessandro Flammini, Alessandro Vespignani
:
Ranking web sites with real user traffic. 65-76 - Michael J. Taylor, John Guiver, Stephen Robertson
, Tom Minka:
SoftRank: optimizing non-smooth rank metrics. 77-86 - Nick Craswell, Onno Zoeter, Michael J. Taylor, Bill Ramsey:
An experimental comparison of click position-bias models. 87-94 - Gregory Buehrer, Kumar Chellapilla:
A scalable pattern mining approach to web graph compression with communities. 95-106 - Jian Huang, Ziming Zhuang, Jia Li, C. Lee Giles
:
Collaboration over time: characterizing and modeling network evolution. 107-116 - Lars Backstrom, Ravi Kumar, Cameron Marlow, Jasmine Novak, Andrew Tomkins:
Preferential behavior in online groups. 117-128 - Ravi Kumar, Andrew Tomkins, Erik Vee:
Connectivity structure of bipartite graphs via the KNC-plot. 129-138 - Dikan Xing, Gui-Rong Xue, Qiang Yang, Yong Yu:
Deep classifier: automatically categorizing search results into large-scale hierarchies. 139-148 - Dou Shen, Toby Walker, Zijian Zheng, Qiang Yang, Ying Li:
Personal name classification in web queries. 149-158 - Fernando Mourão, Leonardo Rocha
, Renata Braga Araújo, Thierson Couto, Marcos André Gonçalves
, Wagner Meira Jr.:
Understanding temporal aspects in document classification. 159-170 - Ba-Quy Vuong, Ee-Peng Lim
, Aixin Sun
, Minh-Tam Le, Hady Wirawan Lauw
:
On ranking controversies in wikipedia: models and evaluation. 171-182 - Eugene Agichtein, Carlos Castillo
, Debora Donato, Aristides Gionis, Gilad Mishne:
Finding high-quality content in social media. 183-194 - Paul Heymann, Georgia Koutrika, Hector Garcia-Molina:
Can social bookmarking improve web search? 195-206 - Nitin Agarwal, Huan Liu, Lei Tang, Philip S. Yu:
Identifying the influential bloggers in a community. 207-218 - Nitin Jindal, Bing Liu:
Opinion spam and analysis. 219-230 - Xiaowen Ding, Bing Liu, Philip S. Yu:
A holistic lexicon-based approach to opinion mining. 231-240 - Anindya Ghose, Sha Yang:
An empirical analysis of sponsored search performance in search engine advertising. 241-250 - Yifan Chen, Gui-Rong Xue, Yong Yu:
Advertising keyword suggestion based on concept hierarchy. 251-260
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.