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

Satish Bhat

dblp:09/2363 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

Databases, data management, data science and information retrieval · 3Artificial intelligence and machine learning · 2Software engineering, systems software and programming languages · 2Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 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.

Software engineering, system software, and programming languages
2 papers
Services computing and microservices · 100%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Services computing and microservices
service composition
0.112009
Event Driven Service Composition for Pervasive Computing · PerCom 2009
Services computing and microservices › service discovery
service matching
0.112009
SGPS: a semantic scheme for web service similarity · WWW 2009
Services computing and microservices › service discovery
web service discovery
0.112009
SGPS: a semantic scheme for web service similarity · WWW 2009

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

indexing technique · 0.3activity logic graphs · 0.3semantic genome propagation · 0.1
YearPublicationVenuePosition
2011 Taxonomic Clustering and Query Matching for Efficient Service Discovery
abstract
Service discovery is one of the key problems that have been widely researched in the area of Service Oriented Architecture (SOA) based systems. Web Service clustering is a technique for efficiently facilitating service discovery. Most Web Service clustering approaches are based on suitable semantic similarity distance measure and a threshold. Threshold selection is essentially difficult and often leads to unsatisfactory accuracy. In this paper, we have proposed a self-organizing based clustering algorithm called Taxonomic clustering for taxonomically organizing semantic Web Service advertisements. We have tested the algorithm on both simulation based randomly generated test data and the standard OWL-S TC test data set. We have observed promising results both in terms of accuracy and performance.
Sourish Dasgupta, Satish Bhat, Yugyung Lee
ICWS2
2010 Taxonomic clustering of web service for efficient discovery
abstract
The World Wide Web (WWW) has become a major platform for hosting, discovering, and composing web services. Web service clustering is a technique for efficiently facilitating web service discovery. Most web service clustering approaches are based on suitable semantic similarity distance measure and a threshold. Threshold selection is essentially difficult and often leads to unsatisfactory accuracy. In this paper we propose a taxonomic clustering algorithm for grouping functionally similar web services. We have tested the algorithm on both simulation based randomly generated test data and the standard OWL-S TC test data set. We have observed promising results both in terms of accuracy and performance.
Sourish Dasgupta, Satish Bhat, Yugyung Lee
CIKM2
2009 CAOFES: an ontological framework for web service retrieval
abstract
Semantic web search involves retrieval of user-specific web artifacts by utilizing their semantic descriptions. A very specific web artifact that has evolved in recent times is web services. Web services can be semantically described in languages like OWL-S. However, such languages are limited with respect to their expressivity of context. They also lack a formal ontological framework where efficient web service retrieval can be conducted. In this paper we model a service request scenario within the web as an event-driven system. Services as well as user requests are modeled as events. We propose an ontological framework called Context-Aware Ontology Framework for Events and Services (CAOFES) where such event-driven web service retrieval can be efficiently executed by a novel reasoning technique.
Sourish Dasgupta, Satish Bhat, Yugyung Lee
CIKM2
2009 An Abstraction Framework for Service Composition in Event-Driven SOA Systems
abstract
The three core problems that can be identified with any SOA based system are: (i) service discovery, (ii) service selection, and (iii) service composition. Most of the previous researches have considered these three problems separately. However, we argue that these three problems are intrinsically related and hence, cannot be treated separately. We propose a proactive event-driven model where user activities and services are treated as events. We then graphically model a SOA system into a network of activities called "activity network" (ANet). The nodes of such a network are the services and the edges their mutual causal dependency. We show how both functional as well as contextual information can be incorporated into the network and then justify why that is necessary for solving the three problems mentioned hereby. We then propose an abstraction technique that helps us to simplify the ANet and provide an architectural platform where the three problems can be solved in an efficient manner.
Sourish Dasgupta, Satish Bhat, Yugyung Lee
ICWS2
2009 Event Driven Service Composition for Pervasive Computing
abstract
Pervasive Computing plays an integral role in our daily life. As pervasive services become increasingly important to be able to capture context, it is reasonable to speculate that dynamic representations for composition of services is very much needed. Such representations may typically include activities or functional modules that are not only temporal but also responsive to each other. Such actions may be associated with actors who execute them, spatial and temporal information, information-flow and background objects. Consequently, one may model an activity network that depicts causal relations between activities and has the capability of embedding the semantic relations of these activities with other contextual entities. In this paper we discuss a new way of representing such dynamic workflows with a novel data structure called activity logic graphs (ALGs). We introfduce a novel design of an architecture that grasps the semantics of activities (or events) in dynamic pervasive environments, maps that to a collaboration of services (as ALGs) in order to recognize specific situations (known as Situation Boundaries) that has risen out of the events, and implements the recognition process using an efficient indexing technique. We test the model with a set of ALGs and report experimental results on the queries that are essential for service composition.
Sourish Dasgupta, Satish Bhat, Yugyung Lee
PerCom2
2009 SGPS: a semantic scheme for web service similarity
abstract
Today's Web becomes a platform for services to be dynamically interconnected to produce a desired outcome. It is important to formalize the semantics of the contextual elements of web services. In this paper, we propose a novel technique called Semantic Genome Propagation Scheme (SGPS) for measuring similarity between semantic concepts. We show how SGPS is used to compute a multi-dimensional similarity between two services. We evaluate the SGPS similarity measurement in terms of the similarity performance and scalability.
Sourish Dasgupta, Satish Bhat, Yugyung Lee
WWW2