Demo Data from EDBT 2026 / reviewers in the wild / expert
Gopinath Ganapathy
dblp:55/9080
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2Artificial intelligence and machine learning · 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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Services computing and microservices · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › clustering › hierarchical clustering
agglomerative clustering |
0.2 | 1 | 2016 | An Approach to Computation of Similarity, Inter-Cluster Distance and Selection of Threshold for Service Discovery Using Clusters · IEEE Trans. Serv. Comput. 2016 |
Data mining
clustering |
0.2 | 1 | 2016 | An Approach to Computation of Similarity, Inter-Cluster Distance and Selection of Threshold for Service Discovery Using Clusters · IEEE Trans. Serv. Comput. 2016 |
Services computing and microservices
service discovery |
0.2 | 1 | 2016 | An Approach to Computation of Similarity, Inter-Cluster Distance and Selection of Threshold for Service Discovery Using Clusters · IEEE Trans. Serv. Comput. 2016 |
Methods — techniques the papers use, named apart from their topics
similarity model · 0.5complete linkage · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Efficient Deep Learning Hyperparameter Tuning Using Cloud Infrastructure: Intelligent Distributed Hyperparameter Tuning with Bayesian Optimization in the CloudabstractThe paper discusses how we can leverage cloud infrastructure for efficient hyperparameter tuning of deep neural networks on high dimensional hyperparameter spaces using Bayesian Optimization. The paper experiments Bayesian optimization in the cloud at different levels of concurrency for the warmup runs for the Bayesian optimization. Two different distributed hyperparameter tuning approaches were experimented in the cloud - Training on multiple nodes with higher warm-up concurrency Vs Distributed Training on multiple nodes with Horovod and reduced number of warm-up runs. The results indicate that greater number of warm-up runs for Bayesian optimization results in better exploration of the search space. The hyper parameter tuning and distributed training with Horovod in the cloud was performed using the HyperDrive framework of Azure Machine Learning Service for Video Activity Recognition problem. The experiment used a Long-term Recurrent Convolutional Network (LRCN) with transfer learning from Resnet50 backbone. Mercy Ranjit, Gopinath Ganapathy, Kalaivani Sridhar, Vikram Arumugham |
CLOUD | 2 |
| 2016 | An Approach to Computation of Similarity, Inter-Cluster Distance and Selection of Threshold for Service Discovery Using ClustersabstractMeeting out similarity demands of clients, selection of threshold and computation of inter-cluster distance (ICD) are difficult while clustering. Hierarchical agglomerative clustering based approach is proposed for service discovery including two similarity models viz., Output Similarity Model (OSM) and Total Similarity Model (TSM) with additional levels for Degree of Match (DoM). The OSM which computes similarity between services using solely the outputs of services is proposed while clustering services to eliminate irrelevancy completely. The TSM which computes similarity between services using both inputs and outputs of services is proposed while discovering matched services of a given query. The work justifies the `complete linkage' as suitable method for computing ICD. It selects threshold-ICD in terms of DoM without altering the similarity demands of clients and ensures rightness of clusters. The computation time of discovery using clusters is found to be faster (7.32 against 170.59 seconds) than that of sequential method. Chellammal Surianarayanan, Gopinath Ganapathy |
IEEE Trans. Serv. Comput. | 2 |
| 2015 | An approach for selecting best available services through a new method of decomposing QoS constraints
Chellammal Surianarayanan, Gopinath Ganapathy, Manikandan Sethunarayanan Ramasamy |
Serv. Oriented Comput. Appl. | 2 |
| 2014 | An efficient approach to an automatic detection of erythemato-squamous diseases
K. S. Ravichandran 0001, Badrinath Narayanamurthy, Gopinath Ganapathy, Sri Ravalli, Jaladhanki Sindhura |
Neural Comput. Appl. | 3 |