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

Vishnu Vyas

dblp:36/7536 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 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
1 paper
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › distributional semantics
distributional similarity
0.112009
Web-Scale Distributional Similarity and Entity Set Expansion · EMNLP 2009
Natural language and speech › Information extraction and text analysis › named entity processing
entity set expansion
0.112009
Web-Scale Distributional Similarity and Entity Set Expansion · EMNLP 2009
YearPublicationVenuePosition
2009 Helping editors choose better seed sets for entity set expansion
abstract
Sets of named entities are used heavily at commercial search engines such as Google, Yahoo and Bing. Acquiring sets of entities typically consists of combining semi-supervised expansion algorithms with manual cleaning of the resulting expanded sets. In this paper, we study the effects of different seed sets in a state-of-the-art semi-supervised expansion system and show a tremendous variation in expansion performance depending on the choice of seeds. We further show that human editors, in general, provide very bad seed sets, which perform well-below the average random seed set. We identify three factors of seed set composition, namely prototypicality, ambiguity and coverage, and we investigate their effects on expansion performance. Finally, we propose various automatic systems for improving editor-generated seed sets, which seek to remove ambiguous and other error-prone seed instances. An extensive experimental analysis shows that expansion quality, measured in R-precision, can be improved on average by a maximum of 46% by removing the right seeds from a seed set. Our automatic methods outperform the human editors seed sets and on average improve expansion performance by up to 34% over the original seed sets.
Vishnu Vyas, Patrick Pantel, Eric Crestan
CIKM1
2009 Web-Scale Distributional Similarity and Entity Set Expansion
Patrick Pantel, Eric Crestan, Arkady Borkovsky, Ana-Maria Popescu, Vishnu Vyas
EMNLP5
2009 Semi-Automatic Entity Set Refinement
Vishnu Vyas, Patrick Pantel
HLT-NAACL1
2008 A Joint Information Model for N-Best Ranking
Patrick Pantel, Vishnu Vyas
COLING2
2006 An Algorithm for Site Selection in GIS based on Swarm Intelligence
abstract
Swarm intelligence is about design of distributed algorithms which use simple rules and indirect communication, but result in intelligent emergent behaviour. Geographical Information Systems are systems which are able to analyse, manipulate and store vast amounts of spatial data. In this paper we study the use of swarm intelligence based algorithms for use in GIS and this is demonstrated with an example of the problem of site selection, also called as location allocation. An agent algorithm inspired from the nest building behaviour of natural termites is discussed and some simulation results are also provided.
Vishnu Vyas, Dipti Deodhare
IEEE Congress on Evolutionary Computation2