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

Lushan Han

dblp:42/5913 · DBLP profile ↗
← Back
6ranked-venue papers
5as 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 · 4 · 4 first-authorArtificial intelligence and machine learning · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 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.

Artificial intelligence
2 papers
Information extraction and text analysis · 86% Knowledge representation and reasoning · 14%
Databases, data mining, and information retrieval
2 papers
Data integration and cleaning · 56% Information retrieval · 44%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Environmental and earth informatics · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
pointwise mutual information
0.212013
Improving Word Similarity by Augmenting PMI with Estimates of Word Polysemy · IEEE Trans. Knowl. Data Eng. 2013
Natural language and speech › Information extraction and text analysis › lexical semantics › lexicon learning
thesaurus extraction
0.212013
Improving Word Similarity by Augmenting PMI with Estimates of Word Polysemy · IEEE Trans. Knowl. Data Eng. 2013
Natural language and speech › Information extraction and text analysis › text similarity › semantic similarity
word similarity
0.212013
Improving Word Similarity by Augmenting PMI with Estimates of Word Polysemy · IEEE Trans. Knowl. Data Eng. 2013
Knowledge, reasoning and agents › Knowledge representation and reasoning
ontology
0.112008
Predicting Appropriate Semantic Web Terms from Words · AAAI 2008

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

pointwise mutual information · 0.3semantic web · 0.1ontology · 0.1
YearPublicationVenuePosition
2015 Querying RDF data with text annotated graphs
abstract
Scientists and casual users need better ways to query RDF databases or Linked Open Data. Using the SPARQL query language requires not only mastering its syntax and semantics but also understanding the RDF data model, the ontology used, and URIs for entities of interest. Natural language query systems are a powerful approach, but current techniques are brittle in addressing the ambiguity and complexity of natural language and require expensive labor to supply the extensive domain knowledge they need. We introduce a compromise in which users give a graphical "skeleton" for a query and annotates it with freely chosen words, phrases and entity names. We describe a framework for interpreting these "schema-agnostic queries" over open domain RDF data that automatically translates them to SPARQL queries. The framework uses semantic textual similarity to find mapping candidates and uses statistical approaches to learn domain knowledge for disambiguation, thus avoiding expensive human efforts required by natural language interface systems. We demonstrate the feasibility of the approach with an implementation that performs well in an evaluation on DBpedia data.
Lushan Han, Tim Finin, Anupam Joshi, Doreen Cheng
SSDBM1
2013 Improving Word Similarity by Augmenting PMI with Estimates of Word Polysemy
abstract
Pointwise mutual information (PMI) is a widely used word similarity measure, but it lacks a clear explanation of how it works. We explore how PMI differs from distributional similarity, and we introduce a novel metric, PMImax, that augments PMI with information about a word's number of senses. The coefficients of PMImaxare determined empirically by maximizing a utility function based on the performance of automatic thesaurus generation. We show that it outperforms traditional PMI in the application of automatic thesaurus generation and in two word similarity benchmark tasks: human similarity ratings and TOEFL synonym questions. PMImaxachieves a correlation coefficient comparable to the best knowledge-based approaches on the Miller-Charles similarity rating data set.
Lushan Han, Tim Finin, Paul McNamee, Anupam Joshi, Yelena Yesha
IEEE Trans. Knowl. Data Eng.1
2012 Schema-free structured querying of DBpedia data
abstract
We need better ways to query large linked data collections such as DBpedia. Using the SPARQL query language requires not only mastering its syntax but also understanding the RDF data model, large ontology vocabularies and URIs for denoting entities. Natural language interface systems address the problem, but are still subjects of research. We describe a compromise in which non-experts specify a graphical query "skeleton" and annotate it with freely chosen words, phrases and entity names. The combination reduces ambiguity and allows the generation of an interpretation that can be translated into SPARQL. Key research contributions are the robust methods that combine statistical association and semantic similarity to map user terms to the most appropriate classes and properties in the underlying ontology.
Lushan Han, Tim Finin, Anupam Joshi
CIKM1
2008 Predicting Appropriate Semantic Web Terms from Words
Lushan Han, Tim Finin
AAAI1
2008 RDF123: From Spreadsheets to RDF
Lushan Han, Tim Finin, Cynthia Sims Parr, Joel Sachs, Anupam Joshi
ISWC1
2006 Using the Semantic Web to Integrate Ecoinformatics Resources
Cynthia Sims Parr, Andriy Parafiynyk, Joel Sachs, Lushan Han, Li Ding 0001, Tim Finin, David Wang 0003
AAAI5