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

S. Shivashankar

dblp:78/3970 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2015
0000-0001-6994-3662ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.212015
CEIL: A Scalable, Resolution Limit Free Approach for Detecting Communities in Large Networks · IJCAI 2015
Data mining › structured data mining › graph mining
community detection
0.212015
CEIL: A Scalable, Resolution Limit Free Approach for Detecting Communities in Large Networks · IJCAI 2015
Bioinformatics and computational biology
protein structure analysis
0.112011
Multi-view methods for protein structure comparison using latent dirichlet allocation · Bioinform. 2011
Bioinformatics and computational biology › structural bioinformatics › protein structure database
protein structure retrieval
0.112011
Multi-view methods for protein structure comparison using latent dirichlet allocation · Bioinform. 2011
Bioinformatics and computational biology › structural bioinformatics
protein structure representation
0.012011
Multi-view methods for protein structure comparison using latent dirichlet allocation · Bioinform. 2011

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

resolution limit free clustering · 0.4multi-view retrieval · 0.1latent dirichlet allocation · 0.1
YearPublicationVenuePosition
2015 CEIL: A Scalable, Resolution Limit Free Approach for Detecting Communities in Large Networks
Vishnu Sankar, Balaraman Ravindran, S. Shivashankar
IJCAI3
2011 Multi-view methods for protein structure comparison using latent dirichlet allocation
abstract
MOTIVATION: With rapidly expanding protein structure databases, efficiently retrieving structures similar to a given protein is an important problem. It involves two major issues: (i) effective protein structure representation that captures inherent relationship between fragments and facilitates efficient comparison between the structures and (ii) effective framework to address different retrieval requirements. Recently, researchers proposed vector space model of proteins using bag of fragments representation (FragBag), which corresponds to the basic information retrieval model. RESULTS: In this article, we propose an improved representation of protein structures using latent dirichlet allocation topic model. Another important requirement is to retrieve proteins, whether they are either close or remote homologs. In order to meet diverse objectives, we propose multi-viewpoint based framework that combines multiple representations and retrieval techniques. We compare the proposed representation and retrieval framework on the benchmark dataset developed by Kolodny and co-workers. The results indicate that the proposed techniques outperform state-of-the-art methods. AVAILABILITY: http://www.cse.iitm.ac.in/~ashishvt/research/protein-lda/. CONTACT: [email protected].
S. Shivashankar, S. Srivathsan, Balaraman Ravindran, Ashish V. Tendulkar
Bioinform.1
2010 Multi Grain Sentiment Analysis using Collective Classification
abstract
Multi grain sentiment analysis is the task of simultaneously classifying sentiment expressed at different levels of granularity, as opposed to single level at a time. Models built for multi grain sentiment analysis assume fully labeled corpus at fine grained level or coarse grained level or both. Huge amount of online reviews are not fully labeled at any of the levels, but are partially labeled at both the levels. We propose a multi grain collective classification framework to not only exploit the information available at all the levels but also use intra dependencies at each level and inter dependencies between the levels. We demonstrate empirically that the proposed framework enables better performance at both the levels compared to baseline approaches.
S. Shivashankar, Balaraman Ravindran
ECAI1
2008 Wavelet based co-occurrence histogram features for texture classification with an application to script identification in a document image
Prakash S. Hiremath, S. Shivashankar
Pattern Recognit. Lett.2