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

Lee Wang

dblp:38/6031 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2007
—ORCID · unresolved

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

Databases, data management, data science and information retrieval · 3 · 1 first-authorArtificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging 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% Web and social media mining · 20%

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

TopicWeightPapersLastEvidence papers
Information retrieval
query understanding
0.122006
Detecting online commercial intention (OCI) · WWW 2006
Detecting dominant locations from search queries · SIGIR 2005
Information retrieval › query understanding
user intent classification
0.112006
Detecting online commercial intention (OCI) · WWW 2006
Web and social media mining
web page analysis
0.112006
Detecting online commercial intention (OCI) · WWW 2006
Information retrieval › ranking
search relevance
0.112005
Detecting dominant locations from search queries · SIGIR 2005
Information retrieval
query log analysis
0.012005
Detecting dominant locations from search queries · SIGIR 2005

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

text classification · 0.1machine learning · 0.1search result mining · 0.1recursive query segmentation · 0.1
YearPublicationVenuePosition
2007 Computing Geographical Serving Area Based on Search Logs and Website Categorization
Qi Zhang 0066, Xing Xie 0001, Lee Wang, Lihua Yue, Wei-Ying Ma
DEXA3
2006 Detecting online commercial intention (OCI)
abstract
Understanding goals and preferences behind a user's online activities can greatly help information providers, such as search engine and E-Commerce web sites, to personalize contents and thus improve user satisfaction. Understanding a user's intention could also provide other business advantages to information providers. For example, information providers can decide whether to display commercial content based on user's intent to purchase. Previous work on Web search defines three major types of user search goals for search queries: navigational, informational and transactional or resource [1][7]. In this paper, we focus our attention on capturing commercial intention from search queries and Web pages, i.e., when a user submits the query or browse a Web page, whether he/she is about to commit or in the middle of a commercial activity, such as purchase, auction, selling, paid service, etc. We call the commercial intentions behind a user's online activities as OCI (Online Commercial Intention). We also propose the notion of "Commercial Activity Phase" (CAP), which identifies in which phase a user is in his/her commercial activities: Research or Commit. We present the framework of building machine learning models to learn OCI based on any Web page content. Based on that framework, we build models to detect OCI from search queries and Web pages. We train machine learning models from two types of data sources for a given search query: content of algorithmic search result page(s) and contents of top sites returned by a search engine. Our experiments show that the model based on the first data source achieved better performance. We also discover that frequent queries are more likely to have commercial intention. Finally we propose our future work in learning richer commercial intention behind users' online activities.
Honghua (Kathy) Dai, Zaiqing Nie, Ji-Rong Wen, Lee Wang, Ying Li 0040
WWW5
2005 Detecting dominant locations from search queries
abstract
Accurately and effectively detecting the locations where search queries are truly about has huge potential impact on increasing search relevance. In this paper, we define a search query's dominant location (QDL) and propose a solution to correctly detect it. QDL is geographical location(s) associated with a query in collective human knowledge, i.e., one or few prominent locations agreed by majority of people who know the answer to the query. QDL is a subjective and collective attribute of search queries and we are able to detect QDLs from both queries containing geographical location names and queries not containing them. The key challenges to QDL detection include false positive suppression (not all contained location names in queries mean geographical locations), and detecting implied locations by the context of the query. In our solution, a query is recursively broken into atomic tokens according to its most popular web usage for reducing false positives. If we do not find a dominant location in this step, we mine the top search results and/or query logs (with different approaches discussed in this paper) to discover implicit query locations. Our large-scale experiments on recent MSN Search queries show that our query location detection solution has consistent high accuracy for all query frequency ranges.
Lee Wang, Chuang Wang 0001, Xing Xie 0001, Joshua J. Forman, Yansheng Lu, Wei-Ying Ma, Ying Li 0012
SIGIR1
1997 Task Matching and Scheduling in Heterogenous Computing Environments Using a Genetic-Algorithm-Based Approach
Lee Wang, Howard Jay Siegel, Vwani P. Roychowdhury, Anthony A. Maciejewski
J. Parallel Distributed Comput.1