default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKavita Ganesan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[i1]Kavita Ganesan:
ROUGE 2.0: Updated and Improved Measures for Evaluation of Summarization Tasks. CoRR abs/1803.01937 (2018)- 2016
- [c11]Guangyu Zhou, Kavita Ganesan:
Linguistic Understanding of Complaints and Praises in User Reviews. WASSA@NAACL-HLT 2016: 109-114 - 2015
- [j2]Kavita Ganesan, ChengXiang Zhai:
OpinoFetch: a practical and efficient approach to collecting opinions on arbitrary entities. Inf. Retr. J. 18(6): 530-558 (2015) - 2014
- [c10]Kavita Ganesan, Michael Subotin:
A general supervised approach to segmentation of clinical texts. IEEE BigData 2014: 33-40 - 2013
- [b1]Kavita Ganesan:
Opinion driven decision support system. University of Illinois Urbana-Champaign, USA, 2013 - [c9]Kavita Ganesan, ChengXiang Zhai:
FindiLike: a preference driven entity search engine for evaluating entity retrieval and opinion summarization. LivingLab@CIKM 2013: 19-22 - 2012
- [j1]Kavita Ganesan, ChengXiang Zhai:
Opinion-based entity ranking. Inf. Retr. 15(2): 116-150 (2012) - [c8]Kavita Ganesan, ChengXiang Zhai:
FindiLike: preference driven entity search. WWW (Companion Volume) 2012: 345-348 - [c7]Kavita Ganesan, ChengXiang Zhai, Evelyne Viegas:
Micropinion generation: an unsupervised approach to generating ultra-concise summaries of opinions. WWW 2012: 869-878 - 2011
- [d2]Kavita Ganesan, ChengXiang Zhai:
OpinRank Review Dataset. UCI Machine Learning Repository, 2011
- 2010
- [c6]Kavita Ganesan, ChengXiang Zhai, Jiawei Han:
Opinosis: A Graph Based Approach to Abstractive Summarization of Highly Redundant Opinions. COLING 2010: 340-348 - [d1]Kavita Ganesan:
Opinosis Opinion ⁄ Review. UCI Machine Learning Repository, 2010
2000 – 2009
- 2009
- [c5]Yuanhua Lv, Jing He, V. G. Vinod Vydiswaran, Kavita Ganesan, ChengXiang Zhai:
A Study of Term Proximity and Document Weighting Normalization in Pseudo Relevance Feedback--UIUC at TREC 2009 Million Query Track. TREC 2009 - [c4]V. G. Vinod Vydiswaran, Kavita Ganesan, Yuanhua Lv, Jing He, ChengXiang Zhai:
Finding Related Entities by Retrieving Relations: UIUC at TREC 2009 Entity Track. TREC 2009 - 2007
- [c3]Craig A. Knoblock, José Luis Ambite, Kavita Ganesan, Maria Muslea, Steven Minton, Greg Barish, Evan Gamble, Claude Nanjo, Kane See, Cyrus Shahabi, Ching-Chien Chen:
EntityBases: Compiling, Organizing and Querying Massive Entity Repositories. IC-AI 2007: 15-21 - [c2]Neel Sundaresan, Kavita Ganesan, Roopnath Grandhi:
Multi-factor clustering for a marketplace search interface. WWW 2007: 1181-1182 - 2005
- [c1]Andrew S. Gordon, Kavita Ganesan:
Automated story capture from conversational speech. K-CAP 2005: 145-152
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-08 19:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
