VLDB 2026 Research / reviewers in the wild / expert
Ya-nan Qian
dblp:52/7579
· DBLP profile ↗
8ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 6 · 3 first-authorArtificial intelligence and machine learning · 3 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
2 papers |
Information retrieval · 80% Data mining · 20% | |
| Artificial intelligence
1 paper |
Information extraction and text analysis · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
query understanding |
0.1 | 1 | 2012 | Mining query subtopics from search log data · SIGIR 2012 |
Information retrieval › search engines
search result clustering |
0.1 | 1 | 2012 | Mining query subtopics from search log data · SIGIR 2012 |
Information retrieval › query understanding
subtopic mining |
0.1 | 1 | 2012 | Mining query subtopics from search log data · SIGIR 2012 |
Data mining
text mining |
0.1 | 1 | 2011 | Mining learning-dependency between knowledge units from text · VLDB J. 2011 |
Information retrieval
ranking |
0.0 | 1 | 2012 | Mining query subtopics from search log data · SIGIR 2012 |
Information retrieval
reranking |
0.0 | 1 | 2012 | Mining query subtopics from search log data · SIGIR 2012 |
Methods — techniques the papers use, named apart from their topics
text mining · 0.2search log analysis · 0.1clustering · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Dynamic author name disambiguation for growing digital libraries
Ya-nan Qian, Tetsuya Sakai, Junting Ye, Jun Liu 0002 |
Inf. Retr. J. | 1 |
| 2014 | Recognizing and regulating e-learners' emotions based on interactive Chinese texts in e-learning systems
Feng Tian 0002, Pengda Gao, Longzhuang Li, Weizhan Zhang, Huijun Liang, Ya-nan Qian, Ruomeng Zhao |
Knowl. Based Syst. | 6 |
| 2013 | Dynamic query intent mining from a search log streamabstractIt has long been recognized that search queries are often broad and ambiguous. Even when submitting the same query, different users may have different search intents. Moreover, the intents are dynamically evolving. Some intents are constantly popular with users, others are more bursty. We propose a method for mining dynamic query intents from search query logs. By regarding the query logs as a data stream, we identify constant intents while quickly capturing new bursty intents. To evaluate the accuracy and efficiency of our method, we conducted experiments using 50 topics from the NTCIR INTENT-9 data and additional five popular topics, all supplemented with six-month query logs from a commercial search engine. Our results show that our method can accurately capture new intents with short response time. Ya-nan Qian, Tetsuya Sakai, Junting Ye |
CIKM | 1 |
| 2013 | Mining subtopics from text fragments for a web query
Qinglei Wang, Ya-nan Qian, Ruihua Song, Zhicheng Dou, Fan Zhang 0092, Tetsuya Sakai |
Inf. Retr. | 2 |
| 2012 | Mining query subtopics from search log dataabstractMost 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 of user behavior that can be leveraged to identify query subtopics, referred to as `one subtopic per search' and `subtopic clarification by keyword'. One subtopic per search means that if a user clicks multiple URLs in one query, then the clicked URLs tend to represent the same sense or facet. Subtopic clarification by keyword means that users often add an additional keyword or keywords to expand the query in order to clarify their search intent. Thus, the keywords tend to be indicative of the sense or facet. We propose a clustering algorithm that can effectively leverage the two phenomena to automatically mine the major subtopics of queries, where each subtopic is represented by a cluster containing a number of URLs and keywords. The mined subtopics of queries can be used in multiple tasks in web search and we evaluate them in aspects of the search result presentation such as clustering and re-ranking. We demonstrate that our clustering algorithm can effectively mine query subtopics with an F1 measure in the range of 0.896-0.956. Our experimental results show that the use of the subtopics mined by our approach can significantly improve the state-of-the-art methods used for search result clustering. Experimental results based on click data also show that the re-ranking of search result based on our method can significantly improve the efficiency of users' ability to find information. Yunhua Hu, Ya-nan Qian, Hang Li 0001, Daxin Jiang, Jian Pei 0001 |
SIGIR | 2 |
| 2011 | Combining machine learning and human judgment in author disambiguationabstractAuthor disambiguation in digital libraries becomes increasingly difficult as the number of publications and consequently the number of ambiguous author names keep growing. The fully automatic author disambiguation approach could not give satisfactory results due to the lack of signals in many cases. Furthermore, human judgment on the basis of automatic algorithms is also not suitable because the automatically disambiguated results are often mixed and not understandable for humans. In this paper, we propose a Labeling Oriented Author Disambiguation approach, called LOAD, to combine machine learning and human judgment together in author disambiguation. LOAD exploits a framework which consists of high precision clustering, high recall clustering, and top dissimilar clusters selection and ranking. In the framework, supervised learning algorithms are used to train the similarity functions between publications and a clustering algorithm is further applied to generate clusters. To validate the effectiveness and efficiency of the proposed LOAD approach, comprehensive experiments are conducted. Comparing to conventional author disambiguation algorithms, the LOAD yields much more accurate results to assist human labeling. Further experiments show that the LOAD approach can save labeling time dramatically. Ya-nan Qian, Yunhua Hu, Jianling Cui, Zaiqing Nie |
CIKM | 1 |
| 2011 | Mining learning-dependency between knowledge units from text
Jun Liu 0002, Lu Jiang 0001, Zhaohui Wu 0003, Ya-nan Qian |
VLDB J. | 5 |
| 2009 | ETM Toolkit: A development tool based on Extended Topic MapabstractBy research on topic map standard, the extended topic map (ETM) is proposed as a novel model for organization and management of the massive knowledge resources in e-learning. Based on the model, an extended topic map toolkit is designed and implemented, which allows for operations as exploration, search, consistency check and etc. The ETM toolkit not only provides learners with visual navigation and search on massive e-learning resources, but also offers an efficient way for instructors to build the shareable and reusable domain knowledge. By ETM toolkit, an extended topic map with a certain scale on computer networks has been built and is currently available for students in our university. Lu Jiang 0001, Jun Liu 0002, Zhaohui Wu 0003, Ya-nan Qian |
CSCWD | 5 |