Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xitong Liu

dblp:06/10440 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
0since 2021 · last 2015
0000-0002-5197-3422ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 7 · 6 first-authorArtificial intelligence and machine learning · 4 · 2 first-author

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
1 paper
Information retrieval · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › document retrieval
concept-based retrieval
0.212014
A Study of Concept-based Weighting Regularization for Medical Records Search · ACL (1) 2014
Information retrieval › document retrieval › domain-specific retrieval › biomedical information retrieval
medical records search
0.212014
A Study of Concept-based Weighting Regularization for Medical Records Search · ACL (1) 2014

Methods — techniques the papers use, named apart from their topics

weighting regularization · 0.2axiomatic approach · 0.2
YearPublicationVenuePosition
2015 Latent entity space: a novel retrieval approach for entity-bearing queries
Xitong Liu, Hui Fang 0001
Inf. Retr. J.1
2014 A Study of Concept-based Weighting Regularization for Medical Records Search
abstract
An important search task in the biomedical domain is to find medical records of patients who are qualified for a clinical trial.One commonly used approach is to apply NLP tools to map terms from queries and documents to concepts and then compute the relevance scores based on the conceptbased representation.However, the mapping results are not perfect, and none of previous work studied how to deal with them in the retrieval process.In this paper, we focus on addressing the limitations caused by the imperfect mapping results and study how to further improve the retrieval performance of the concept-based ranking methods.In particular, we apply axiomatic approaches and propose two weighting regularization methods that adjust the weighting based on the relations among the concepts.Experimental results show that the proposed methods are effective to improve the retrieval performance, and their performances are comparable to other top-performing systems in the TREC Medical Records Track.
Yue Wang 0037, Xitong Liu, Hui Fang 0001
ACL (1)2
2014 EntEXPO: An Interactive Search System for Entity-Bearing Queries
Xitong Liu, Hui Fang 0001
ECIR1
2014 Wikimantic: Toward effective disambiguation and expansion of queries
Christopher Boston, Hui Fang 0001, Sandra Carberry, Hao Wu 0036, Xitong Liu
Data Knowl. Eng.5
2014 Exploiting entity relationship for query expansion in enterprise search
Xitong Liu, Hui Fang 0001, Min Wang 0001
Inf. Retr.1
2013 An exploration of ranking models and feedback method for related entity finding
Xitong Liu, Wei Zheng 0007, Hui Fang 0001
Inf. Process. Manag.1
2012 Entity centric query expansion for enterprise search
abstract
Enterprise search is important, and the search quality has a direct impact on the productivity of an enterprise. Many information needs of enterprise search center around entities. Intuitively, information related to the entities mentioned in the query, such as related entities, would be useful to reformulate the query and improve the retrieval performance. However, most existing studies on query expansion are term-centric. In this paper, we propose a novel entity-centric query expansion framework for enterprise search. Specifically, given a query containing entities, we first utilize both unstructured and structured information to find entities that are related to the ones in the query. We then discuss how to adapt existing feedback methods to use the related entities to improve search quality. Experiment results show that the proposed entity-centric query expansion strategy is more effective to improve the search performance than the state-of-the-art pseudo feedback methods on longer, natural language-like queries with entities.
Xitong Liu, Hui Fang 0001, Min Wang 0001
CIKM1
2011 Finding relevant information of certain types from enterprise data
abstract
Search over enterprise data is essential to every aspect of an enterprise because it helps users fulfill their information needs. Similar to Web search, most queries in enterprise search are keyword queries. However, enterprise search is a unique research problem because, compared with the data in traditional IR applications (e.g., text data), enterprise data includes information stored in different formats. In particular, enterprise data include both unstructured and structured information, and all the data center around a particular enterprise. As a result, the relevant information from these two data sources could be complementary to each other. Intuitively, such integrated data could be exploited to improve the enterprise search quality. Despite its importance, this problem has received little attention so far. In this paper, we demonstrate the feasibility of leveraging the integrated information in enterprise data to improve search quality through a case study, i.e., finding relevant information of certain types from enterprise data. Enterprise search users often look for different types of relevant information other than documents, e.g., the contact information of per- sons working on a product. When formulating a keyword query, search users may specify both content requirements, i.e., what kind of information is relevant, and type requirements, i.e., what type of information is relevant. Thus, the goal is to find information relevant to both requirements specified in the query. Specifically, we formulate the problem as keyword search over structured or semistructured data, and then propose to leverage the complementary unstructured information in the enterprise data to solve the problem. Experiment results over real world enterprise data and simulated data show that the proposed methods can effectively exploit the unstructured information to find relevant information of certain types from structured and semistructured information in enterprise data.
Xitong Liu, Hui Fang 0001, Conglei Yao, Min Wang 0001
CIKM1