Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Sumitra 0001
Person information
- affiliation: Indian Institute of Space Science and Technology, Department of Mathematics, Thiruvananthapuram, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j7]Asif Salim
, S. Sumitra:
Spectral Graph Convolutional Neural Networks in the Context of Regularization Theory. IEEE Trans. Neural Networks Learn. Syst. 35(4): 4373-4384 (2024)- 2023
- [j6]Asif Salim, S. S. Shiju, S. Sumitra:
Neighborhood Preserving Kernels for Attributed Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 45(1): 828-840 (2023) - 2022
- [j5]Asif Salim, S. S. Shiju, S. Sumitra:
Graph kernels based on optimal node assignment. Knowl. Based Syst. 244: 108519 (2022) - 2020
- [j4]Asif Salim, S. S. Shiju, S. Sumitra:
Design of multi-view graph embedding using multiple kernel learning. Eng. Appl. Artif. Intell. 90: 103534 (2020) - 2019
- [j3]A. Aravindh, S. S. Shiju, S. Sumitra:
Kernel collaborative online algorithms for multi-task learning. Ann. Math. Artif. Intell. 86(4): 269-286 (2019) - 2017
- [j2]Shiju S. S., Asif Salim, S. Sumitra:
Multiple kernel learning using composite kernel functions. Eng. Appl. Artif. Intell. 64: 391-400 (2017) - [j1]Shiju S. S., S. Sumitra:
Multiple kernel learning using single stage function approximation for binary classification problems. Int. J. Syst. Sci. 48(16): 3569-3580 (2017)
Conference and Workshop Papers
- 2022
- [c5]Adarsh Kappiyath, Silpa Vadakkeeveetil Sreelatha, S. Sumitra:
Self-Supervised Enhancement of Latent Discovery in GANs. AAAI 2022: 7078-7086 - [c4]Pratik Kar, Vineeth Bala Sukumaran, S. Sumitra:
On safe sequential optimization using posterior sampling. SPCOM 2022: 1-5 - 2021
- [c3]Adarsh Kappiyath, Silpa V. S, S. Sumitra:
Disentanglement based Active Learning. IJCNN 2021: 1-8 - 2017
- [c2]S. S. Shiju, Asif Salim, S. Sumitra:
Formulation of Two Stage Multiple Kernel Learning Using Regression Framework. PReMI 2017: 61-68 - [c1]Asif Salim, S. S. Shiju, S. Sumitra:
Effectiveness of Representation and Length Variation of Shortest Paths in Graph Classification. PReMI 2017: 509-516
Informal and Other Publications
- 2021
- [i6]Sandeep CR, Asif Salim, Sumitra Sarada:
Selecting the Points for Training using Graph Centrality. CoRR abs/2104.14123 (2021) - [i5]Silpa Vadakkeeveetil Sreelatha, Adarsh Kappiyath, S. Sumitra:
Self-supervised Enhancement of Latent Discovery in GANs. CoRR abs/2112.08835 (2021) - 2020
- [i4]Asif Salim, S. Sumitra:
Framework for Designing Filters of Spectral Graph Convolutional Neural Networks in the Context of Regularization Theory. CoRR abs/2009.13801 (2020) - [i3]Asif Salim, Shiju S. S., S. Sumitra:
Neighborhood Preserving Kernels for Attributed Graphs. CoRR abs/2010.06261 (2020) - 2019
- [i2]Rahul Vashisht, H. Viji, T. Sundararajan, D. Mohankumar, S. Sumitra:
Structural Health Monitoring of Cantilever Beam, a Case Study - Using Bayesian Neural Network AND Deep Learning. CoRR abs/1908.06326 (2019) - [i1]Silpa V. S, Adarsh K, S. Sumitra, Raju K. George:
Disentanglement based Active Learning. CoRR abs/1912.07018 (2019)
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-07-09 04:54 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:
