Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXuan Zhang 0007
Person information
- affiliation: University of Agder, Grimstad, Norway
Other persons with the same name
- Xuan Zhang — disambiguation page
- Xuan Zhang 0001
![[0000-0002-0482-5435]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-0482-5435")
— Harvard University, Cambridge, MA, USA (and 1 more) - Xuan Zhang 0002 — Yunnan University, School of Software, Yunnan, China
- Xuan Zhang 0003 — University of Electronic Science and Technology of China, Chengdu, China
- Xuan Zhang 0004 — Tsinghua-Berkeley Shenzhen Institute, Shenzhen, China (and 3 more)
- Xuan Zhang 0005 — Virginia Tech, Blacksburg, USA
- Xuan Zhang 0006 — Tsinghua University, Institute for Network Sciences and Cyberspace, Beijing, China
- Xuan Zhang 0008 — Johns Hopkins University, Baltimore, MD, USA
- Xuan Zhang 0009 (aka: Alex X. Zhang 0002) — Renmin University of China, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Lei Jiao, Xuan Zhang, Ole-Christoffer Granmo, Kuruge Darshana Abeyrathna:
On the Convergence of Tsetlin Machines for the XOR Operator. IEEE Trans. Pattern Anal. Mach. Intell. 45(5): 6072-6085 (2023)- [c13]Kuruge Darshana Abeyrathna, Ahmed Abdulrahem Othman Abouzeid, Bimal Bhattarai, Charul Giri, Sondre Glimsdal, Ole-Christoffer Granmo, Lei Jiao, Rupsa Saha, Jivitesh Sharma, Svein Anders Tunheim, Xuan Zhang:
Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Size. IJCAI 2023: 3395-3403 - [i7]Kuruge Darshana Abeyrathna, Ahmed Abdulrahem Othman Abouzeid, Bimal Bhattarai, Charul Giri, Sondre Glimsdal, Ole-Christoffer Granmo, Lei Jiao, Rupsa Saha, Jivitesh Sharma, Svein Anders Tunheim, Xuan Zhang:
Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Size. CoRR abs/2301.08190 (2023) - [i6]Jinbao Zhang, Xuan Zhang, Lei Jiao, Ole-Christoffer Granmo, Yongjun Qian, Fan Pan:
Interpretable Tsetlin Machine-based Premature Ventricular Contraction Identification. CoRR abs/2301.10181 (2023) - [i5]Ole-Christoffer Granmo, Per-Arne Andersen, Lei Jiao, Xuan Zhang, Christian D. Blakely, Tor Oddbjørn Tveit:
Learning Minimalistic Tsetlin Machine Clauses with Markov Boundary-Guided Pruning. CoRR abs/2309.06315 (2023) - 2022
- [j8]Xuan Zhang, Lei Jiao, Ole-Christoffer Granmo, Morten Goodwin:
On the Convergence of Tsetlin Machines for the IDENTITY- and NOT Operators. IEEE Trans. Pattern Anal. Mach. Intell. 44(10): 6345-6359 (2022) - [c12]Rebekka Olsson Omslandseter, Lei Jiao, Xuan Zhang, Anis Yazidi, B. John Oommen:
The Hierarchical Discrete Learning Automaton Suitable for Environments with Many Actions and High Accuracy Requirements. AI 2022: 507-518 - [c11]B. John Oommen, Xuan Zhang, Lei Jiao:
A Comprehensive Survey of Estimator Learning Automata and Their Recent Convergence Results. Honoring Professor Mohammad S. Obaidat 2022: 33-52 - 2021
- [i4]Lei Jiao, Xuan Zhang, Ole-Christoffer Granmo, Kuruge Darshana Abeyrathna:
On the Convergence of Tsetlin Machines for the XOR Operator. CoRR abs/2101.02547 (2021) - [i3]Lei Jiao, Xuan Zhang, Ole-Christoffer Granmo:
On the Convergence of Tsetlin Machines for the AND and the OR Operators. CoRR abs/2109.09488 (2021) - 2020
- [j7]Xuan Zhang, Lei Jiao, B. John Oommen, Ole-Christoffer Granmo:
A Conclusive Analysis of the Finite-Time Behavior of the Discretized Pursuit Learning Automaton. IEEE Trans. Neural Networks Learn. Syst. 31(1): 284-294 (2020) - [j6]Anis Yazidi, Xuan Zhang, Lei Jiao, B. John Oommen:
The Hierarchical Continuous Pursuit Learning Automation: A Novel Scheme for Environments With Large Numbers of Actions. IEEE Trans. Neural Networks Learn. Syst. 31(2): 512-526 (2020) - [c10]Kuruge Darshana Abeyrathna, Ole-Christoffer Granmo, Xuan Zhang, Morten Goodwin:
Adaptive Continuous Feature Binarization for Tsetlin Machines Applied to Forecasting Dengue Incidences in the Philippines. SSCI 2020: 2084-2092 - [i2]Xuan Zhang, Lei Jiao, Ole-Christoffer Granmo, Morten Goodwin:
On the Convergence of Tsetlin Machines for the IDENTITY- and NOT Operators. CoRR abs/2007.14268 (2020)
2010 – 2019
- 2019
- [c9]Kuruge Darshana Abeyrathna, Ole-Christoffer Granmo, Xuan Zhang, Morten Goodwin:
A Scheme for Continuous Input to the Tsetlin Machine with Applications to Forecasting Disease Outbreaks. IEA/AIE 2019: 564-578 - [i1]Kuruge Darshana Abeyrathna, Ole-Christoffer Granmo, Xuan Zhang, Morten Goodwin:
A Scheme for Continuous Input to the Tsetlin Machine with Applications to Forecasting Disease Outbreaks. CoRR abs/1905.04199 (2019) - 2018
- [c8]Anis Yazidi, Xuan Zhang, Lei Jiao, B. John Oommen:
The Hierarchical Continuous Pursuit Learning Automation for Large Numbers of Actions. AIAI 2018: 451-461 - 2017
- [j5]Xuan Zhang, B. John Oommen, Ole-Christoffer Granmo:
The design of absorbing Bayesian pursuit algorithms and the formal analyses of their ε-optimality. Pattern Anal. Appl. 20(3): 797-808 (2017) - 2016
- [j4]Xuan Zhang, B. John Oommen, Ole-Christoffer Granmo, Lei Jiao:
A formal proof of the 𝜀-optimality of discretized pursuit algorithms. Appl. Intell. 44(2): 282-294 (2016) - [j3]Lei Jiao, Xuan Zhang, B. John Oommen, Ole-Christoffer Granmo:
Optimizing channel selection for cognitive radio networks using a distributed Bayesian learning automata-based approach. Appl. Intell. 44(2): 307-321 (2016) - 2014
- [j2]Xuan Zhang, Ole-Christoffer Granmo, B. John Oommen, Lei Jiao:
A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions. Appl. Intell. 41(3): 974-985 (2014) - [c7]Lei Jiao, Xuan Zhang, Ole-Christoffer Granmo, B. John Oommen:
A Bayesian Learning Automata-Based Distributed Channel Selection Scheme for Cognitive Radio Networks. IEA/AIE (2) 2014: 48-57 - [c6]Xuan Zhang, B. John Oommen, Ole-Christoffer Granmo, Lei Jiao:
Using the Theory of Regular Functions to Formally Prove the ε-Optimality of Discretized Pursuit Learning Algorithms. IEA/AIE (1) 2014: 379-388 - 2013
- [j1]Xuan Zhang, Ole-Christoffer Granmo, B. John Oommen:
On incorporating the paradigms of discretization and Bayesian estimation to create a new family of pursuit learning automata. Appl. Intell. 39(4): 782-792 (2013) - [c5]Xuan Zhang, Ole-Christoffer Granmo, B. John Oommen, Lei Jiao:
On Using the Theory of Regular Functions to Prove the ε-Optimality of the Continuous Pursuit Learning Automaton. IEA/AIE 2013: 262-271 - [c4]Xuan Zhang, Lei Jiao, Ole-Christoffer Granmo, B. John Oommen:
Channel selection in Cognitive Radio Networks: A Switchable Bayesian Learning Automata approach. PIMRC 2013: 2362-2367 - 2012
- [c3]Xuan Zhang, Ole-Christoffer Granmo, B. John Oommen:
Discretized Bayesian Pursuit - A New Scheme for Reinforcement Learning. IEA/AIE 2012: 784-793 - 2011
- [c2]Xuan Zhang, Ole-Christoffer Granmo, B. John Oommen:
The Bayesian Pursuit Algorithm: A New Family of Estimator Learning Automata. IEA/AIE (2) 2011: 522-531 - [c1]Xuan Zhang, B. John Oommen, Ole-Christoffer Granmo:
Generalized Bayesian Pursuit: A Novel Scheme for Multi-Armed Bernoulli Bandit Problems. EANN/AIAI (2) 2011: 122-131
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-04-15 23:29 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:
