default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuryabhan Singh Hada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Suryabhan Singh Hada
, Miguel Á. Carreira-Perpiñán, Arman Zharmagambetov:
Sparse oblique decision trees: a tool to understand and manipulate neural net features. Data Min. Knowl. Discov. 38(5): 2863-2902 (2024)- 2023
- [c9]Miguel Á. Carreira-Perpiñán, Suryabhan Singh Hada:
Very Fast, Approximate Counterfactual Explanations for Decision Forests. AAAI 2023: 6935-6943 - [i7]Miguel Á. Carreira-Perpiñán, Suryabhan Singh Hada:
Very fast, approximate counterfactual explanations for decision forests. CoRR abs/2303.02883 (2023) - [i6]Miguel Á. Carreira-Perpiñán, Suryabhan Singh Hada:
Inverse classification with logistic and softmax classifiers: efficient optimization. CoRR abs/2309.08945 (2023) - 2022
- [b1]Suryabhan Singh Hada:
Approaches to Interpret Deep Neural Networks. University of California, Merced, USA, 2022 - [c8]Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán:
Interpretable Image Classification Using Sparse Oblique Decision Trees. ICASSP 2022: 2759-2763 - [c7]Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán:
Sparse Oblique Decision Trees: A Tool to Interpret Natural Language Processing Datasets. IJCNN 2022: 1-8 - 2021
- [c6]Miguel Á. Carreira-Perpiñán, Suryabhan Singh Hada:
Counterfactual Explanations for Oblique Decision Trees: Exact, Efficient Algorithms. AAAI 2021: 6903-6911 - [c5]Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán, Arman Zharmagambetov:
Understanding And Manipulating Neural Net Features Using Sparse Oblique Classification Trees. ICIP 2021: 3707-3711 - [c4]Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán:
Sampling The "Inverse Set" of a Neuron. ICIP 2021: 3712-3716 - [c3]Arman Zharmagambetov, Suryabhan Singh Hada, Magzhan Gabidolla, Miguel Á. Carreira-Perpiñán:
Non-Greedy Algorithms for Decision Tree Optimization: An Experimental Comparison. IJCNN 2021: 1-8 - [c2]Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán:
Exploring Counterfactual Explanations for Classification and Regression Trees. PKDD/ECML Workshops (1) 2021: 489-504 - [c1]Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán:
Style Transfer by Rigid Alignment in Neural Net Feature Space. WACV 2021: 2575-2584 - [i5]Miguel Á. Carreira-Perpiñán, Suryabhan Singh Hada:
Counterfactual Explanations for Oblique Decision Trees: Exact, Efficient Algorithms. CoRR abs/2103.01096 (2021) - [i4]Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán, Arman Zharmagambetov:
Sparse Oblique Decision Trees: A Tool to Understand and Manipulate Neural Net Features. CoRR abs/2104.02922 (2021)
2010 – 2019
- 2019
- [i3]Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán:
Style Transfer by Rigid Alignment in Neural Net Feature Space. CoRR abs/1909.13690 (2019) - [i2]Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán:
Sampling the "Inverse Set" of a Neuron: An Approach to Understanding Neural Nets. CoRR abs/1910.04857 (2019) - [i1]Arman Zharmagambetov, Suryabhan Singh Hada, Miguel Á. Carreira-Perpiñán:
An Experimental Comparison of Old and New Decision Tree Algorithms. CoRR abs/1911.03054 (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-10-04 20:58 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:
