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

Rucha Kanade

dblp:131/4254 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 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
Data mining · 32% Data integration and cleaning · 16% Data models and query languages · 16%

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

TopicWeightPapersLastEvidence papers
Web and social media mining
citation network analysis
0.212013
Research-insight: providing insight on research by publication network analysis · SIGMOD Conference 2013
Data mining › structured data mining › graph mining
heterogeneous information network
0.212013
Research-insight: providing insight on research by publication network analysis · SIGMOD Conference 2013
Data mining › structured data mining › graph mining
information network analysis
0.212013
Research-insight: providing insight on research by publication network analysis · SIGMOD Conference 2013
Data integration and cleaning › heterogeneous data integration
unstructured and structured data integration
0.212013
EventCube: multi-dimensional search and mining of structured and text data · KDD 2013
Query processing and optimization
OLAP
0.012013
EventCube: multi-dimensional search and mining of structured and text data · KDD 2013

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

similarity search · 0.2ranking · 0.2entity extraction · 0.2dimension building · 0.2clustering · 0.2classification · 0.2
YearPublicationVenuePosition
2013 EventCube: multi-dimensional search and mining of structured and text data
abstract
A large portion of real world data is either text or structured (e.g., relational) data. Moreover, such data objects are often linked together (e.g., structured specification of products linking with the corresponding product descriptions and customer comments). Even for text data such as news data, typed entities can be extracted with entity extraction tools. The EventCube project constructs TextCube and TopicCube from interconnected structured and text data (or from text data via entity extraction and dimension building), and performs multidimensional search and analysis on such datasets, in an informative, powerful, and user-friendly manner. This proposed EventCube demo will show the power of the system not only on the originally designed ASRS (Aviation Safety Report System) data sets, but also on news datasets collected from multiple news agencies, and academic datasets constructed from the DBLP and web data. The system has high potential to be extended in many powerful ways and serve as a general platform for search, OLAP (online analytical processing) and data mining on integrated text and structured data. After the system demo in the conference, the system will be put on the web for public access and evaluation.
Fangbo Tao, Kin Hou Lei, Jiawei Han 0001, ChengXiang Zhai, Marina Danilevsky, Nihit Desai, Bolin Ding, Heng Ji 0001, Rucha Kanade, Anne Kao, Qi Li 0014, Yanen Li, Cindy Xide Lin, Nikunj C. Oza, Ashok N. Srivastava, Rodney Tjoelker, Chi Wang 0001, Duo Zhang 0001, Bo Zhao 0001
KDD11
2013 Research-insight: providing insight on research by publication network analysis
abstract
A database contains rich, inter-related, multi-typed data and information, forming one or a set of gigantic, intercon- nected, heterogeneous information networks. Much knowl- edge can be derived from such information networks if we systematically develop an effective and scalable database-oriented information network analysis technology. In this system demo, we take a computer science research publica- tion network as an example, which is an information net- work derived from an integration of DBLP, other web-based information about researchers, and partially available cita- tion data, and construct a Research-Insight system in order to demonstrate the power of database-oriented information network analysis. We show that nontrivial research insight can be obtained from such analysis, including (1) ranking, clustering, classification and similarity search of researchers, terms and venues for research subfields and themes, (2) recommending good researchers and good research papers to read or cite when conducting research on certain topics (3) predicting potential collaborators for certain theme-oriented research, and (4) predicting advisor-advisee rela- tionships and affiliation history based on historical research publications. Although some of these functions have been studied in recent research, effective and scalable realization of such functions in large networks still poses challenging research problems. Moreover, some function are our on- going research tasks. By integrating these functionalities, Research-Insight may not only provide with us insightful rec- ommendations in CS research but also help us gain insight on how to perform effective data mining in large databases.
Fangbo Tao, Xiao Yu 0007, Kin Hou Lei, George Brova, Jiawei Han 0001, Rucha Kanade, Yizhou Sun, Chi Wang 0001, Tim Weninger
SIGMOD Conference7