Author image not provided
 Hang Li

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article26.14
Citation Count2,353
Publication count90
Publication years2002-2012
Available for download61
Average downloads per article733.34
Downloads (cumulative)44,734
Downloads (12 Months)2,361
Downloads (6 Weeks)246
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


90 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 90
Result page: 1 2 3 4 5

Sort by:

1 published by ACM
August 2012 SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Downloads (Overall): 436

Full text available: PDFPDF
Topic modeling can reveal the latent structure of text data and is useful for knowledge discovery, search relevance ranking, document classification, and so on. One of the major challenges in topic modeling is to deal with large datasets and large numbers of topics in real-world applications. In this paper, we ...
Keywords: matrix factorization, large scale, topic modeling

2 published by ACM
August 2012 SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Downloads (Overall): 297

Full text available: PDFPDF
Keywords: machine learning, query-document matching, web search

3 published by ACM
August 2012 SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 18
Downloads (6 Weeks): 4,   Downloads (12 Months): 28,   Downloads (Overall): 789

Full text available: PDFPDF
Most queries in web search are ambiguous and multifaceted. Identifying the major senses and facets of queries from search log data, referred to as query subtopic mining in this paper, is a very important issue in web search. Through search log analysis, we show that there are two interesting phenomena ...
Keywords: clustering, search log mining, search result clustering, query subtopics, user behavior

4
July 2012 ACL '12: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2
Publisher: Association for Computational Linguistics
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 3,   Downloads (12 Months): 7,   Downloads (Overall): 105

Full text available: PDFPDF
Natural language questions have become popular in web search. However, various questions can be formulated to convey the same information need, which poses a great challenge to search systems. In this paper, we automatically mined 5w1h question reformulation patterns from large scale search log data. The question reformulations generated from ...

5
July 2012 ACL '12: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Publisher: Association for Computational Linguistics
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 5,   Downloads (12 Months): 28,   Downloads (Overall): 443

Full text available: PDFPDF
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referred to as string re-writing kernel, to address the problem. A string re-writing kernel measures the similarity between two pairs of strings , each ...

6 published by ACM
May 2012 ACM SIGKDD Explorations Newsletter: Volume 13 Issue 2, December 2011
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 16,   Downloads (Overall): 162

Full text available: PDFPDF

7 published by ACM
February 2012 WSDM '12: Proceedings of the fifth ACM international conference on Web search and data mining
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 12,   Downloads (Overall): 414

Full text available: PDFPDF
In web search, relevance ranking of popular pages is relatively easy, because of the inclusion of strong signals such as anchor text and search log data. In contrast, with less popular pages, relevance ranking becomes very challenging due to a lack of information. In this paper the former is referred ...
Keywords: learning to rank, search relevance, tail page, ranking, key n-gram extraction

8 published by ACM
February 2012 WSDM '12: Proceedings of the fifth ACM international conference on Web search and data mining
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 22,   Downloads (Overall): 319

Full text available: PDFPDF
In web search, relevance is one of the most important factors to meet users' satisfaction, and the success of a web search engine heavily depends on its performance on relevance. It has been observed that many hard cases in search relevance are due to term mismatch between query and documnt ...
Keywords: web search, machine learning, query-document matching

9 published by ACM
January 2012 ACM SIGIR Forum: Volume 45 Issue 2, December 2011
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 5,   Downloads (Overall): 68

Full text available: PDFPDF

10 published by ACM
October 2011 ACM Transactions on Intelligent Systems and Technology (TIST): Volume 3 Issue 1, October 2011
Publisher: ACM
Bibliometrics:
Citation Count: 19
Downloads (6 Weeks): 4,   Downloads (12 Months): 29,   Downloads (Overall): 538

Full text available: PDFPDF
Query suggestion plays an important role in improving usability of search engines. Although some recently proposed methods provide query suggestions by mining query patterns from search logs, none of them models the immediately preceding queries as context systematically, and uses context information effectively in query suggestions. Context-aware query suggestion is ...
Keywords: session data, click-through data, Query suggestion, context-aware

11
October 2011 Information Retrieval: Volume 14 Issue 5, October 2011
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 3

This paper is concerned with Markov processes for computing page importance. Page importance is a key factor in Web search. Many algorithms such as PageRank and its variations have been proposed for computing the quantity in different scenarios, using different data sources, and with different assumptions. Then a question arises, ...
Keywords: Page importance, Web Markov skeleton process, PageRank, BrowseRank, Mirror semi-Markov process

12
September 2011 Information Processing and Management: an International Journal: Volume 47 Issue 5, September, 2011
Publisher: Pergamon Press, Inc.
Bibliometrics:
Citation Count: 6

This paper is concerned with the quality of training data in learning to rank for information retrieval. While many data selection techniques have been proposed to improve the quality of training data for classification, the study on the same issue for ranking appears to be insufficient. As pointed out in ...
Keywords: Learning to rank, Selecting optimal training data

13 published by ACM
August 2011 ACM SIGKDD Explorations Newsletter: Volume 13 Issue 1, June 2011
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Downloads (Overall): 63

Full text available: PDFPDF

14 published by ACM
August 2011 KDD '11: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Publisher: ACM
Bibliometrics:
Citation Count: 17
Downloads (6 Weeks): 6,   Downloads (12 Months): 59,   Downloads (Overall): 879

Full text available: PDFPDF
Graph ranking plays an important role in many applications, such as page ranking on web graphs and entity ranking on social networks. In applications, besides graph structure, rich information on nodes and edges and explicit or implicit human supervision are often available. In contrast, conventional algorithms (e.g., PageRank and HITS) ...
Keywords: page importance, mapreduce, pagerank

15
August 2011 AAAI'11: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Several kernel based methods for multi-task learning have been proposed, which leverage relations among tasks as regularization to enhance the overall learning accuracies. These methods assume that the tasks share the same kernel, which could limit their applications because in practice different tasks may need different kernels. The main challenge ...

16 published by ACM
July 2011 SIGIR '11: Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 10,   Downloads (Overall): 259

Full text available: PDFPDF
Huge amounts of search log data have been accumulated in various search engines. Currently, a commercial search engine receives billions of queries and collects tera-bytes of log data on any single day. Other than search log data, browse logs can be collected by client-side browser plug-ins, which record the browse ...
Keywords: log mining, search and browse logs, search applications

17 published by ACM
July 2011 SIGIR '11: Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 27
Downloads (6 Weeks): 4,   Downloads (12 Months): 31,   Downloads (Overall): 502

Full text available: PDFPDF
Topic modeling can boost the performance of information retrieval, but its real-world application is limited due to scalability issues. Scaling to larger document collections via parallelization is an active area of research, but most solutions require drastic steps such as vastly reducing input vocabulary. We introduce Regularized Latent Semantic Indexing ...
Keywords: regularization, sparse methods, topic modeling

18
July 2011 The Journal of Machine Learning Research: Volume 12, 2/1/2011
Publisher: JMLR.org
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 105

Full text available: PDFPDF
This paper points out that many search relevance models in information retrieval, such as the Vector Space Model, BM25 and Language Models for Information Retrieval, can be viewed as a similarity function between pairs of objects of different types, referred to as an S-function. An S-function is specifically defined as ...

19 published by ACM
July 2011 ACM SIGWEB Newsletter: Issue Summer, Summer 2011
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 17,   Downloads (Overall): 154

Full text available: PDFPDF
The Fourth ACM International Conference on Web Search and Data Mining (WSDM 2011) was held in Hong Kong, during February 9--12, 2011.
Keywords: WSDM, web data mining, web search

20
June 2011 HLT '11: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Publisher: Association for Computational Linguistics
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 5,   Downloads (12 Months): 20,   Downloads (Overall): 238

Full text available: PDFPDF
This paper proposes a new method for approximate string search, specifically candidate generation in spelling error correction, which is a task as follows. Given a misspelled word, the system finds words in a dictionary, which are most "similar" to the misspelled word. The paper proposes a probabilistic approach to the ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us