default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRay-Ming Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Ray-Ming Chen
:
A Complete Characterization of Linear Dependence and Independence for All 4-by-4 Metric Matrices. Axioms 13(9): 622 (2024)- [j8]Ray-Ming Chen:
A statistical mining from objective data to subjective knowledge based on granular perception. Soft Comput. 28(13-14): 7783-7790 (2024) - 2023
- [j7]Ray-Ming Chen:
A rough-set and AI based approach for hierarchical cognitive processing of perceptions. Appl. Soft Comput. 136: 110143 (2023) - [j6]Ray-Ming Chen:
A Partition-induced Hereditary Metric for Equivalence Classes - Theory and Application. J. Inf. Sci. Eng. 39(2): 353-373 (2023) - 2022
- [j5]Ray-Ming Chen:
On COVID-19 country containment metrics: a new approach. J. Decis. Syst. 31(1-2): 116-133 (2022) - 2021
- [j4]Ray-Ming Chen:
Distance matrices for nitrogenous bases and amino acids of SARS-CoV-2 via structural metric. J. Bioinform. Comput. Biol. 19(4): 2150011:1-2150011:14 (2021) - 2020
- [j3]Ray-Ming Chen:
Randomness for Nucleotide Sequences of SARS-CoV-2 and Its Related Subfamilies. Comput. Math. Methods Medicine 2020: 8819942:1-8819942:8 (2020) - [c14]Ray-Ming Chen:
A Decision Procedure for Countable Metrics. ICCDE 2020: 99-102 - [c13]Ray-Ming Chen:
Well-behaved Classifiers In Rough Sets. ICCDE 2020: 103-106 - [c12]Ray-Ming Chen:
Two Inductive Approaches for Exact Wilcoxon Signed-rank Distributions without and with Ties. ICoMS 2020: 1-5 - [c11]Ray-Ming Chen:
Metrics for Multi-Set-Theoretic Graphs over Fixed Set of Vertices. ICoMS 2020: 24-28 - [c10]Ray-Ming Chen:
A Unified Proof for Finding a Minimal Spanning Tree. ICoMS 2020: 34-41 - [c9]Ray-Ming Chen:
A Linear Metric for Multivariate Discrete Finite Data Based on Data-derived Analytical Meshes. ICoMS 2020: 60-64 - [c8]Ray-Ming Chen:
A Novel Metric for Incomplete Information Based on Equivalence Classes. SSIP 2020: 79-83 - [c7]Ray-Ming Chen:
Two Characterizations of Riemann Integral Based on Metrics. SSIP 2020: 90-95
2010 – 2019
- 2018
- [j2]Ray-Ming Chen:
A Metric for Finite Power Multisets of Positive Real Numbers Based on Minimal Matching. Axioms 7(4): 94 (2018) - 2014
- [c6]Ray-Ming Chen:
A dynamical model for individual and social cognitive infocommunications over truth values. CogInfoCom 2014: 385-389 - [c5]Ray-Ming Chen:
Full Rough Sets. FedCSIS (Position Papers) 2014: 3-11 - [c4]Ray-Ming Chen:
Subjective characterization of fuzzy target sets based on a fuzzy universe. GrC 2014: 25-29 - [c3]Ray-Ming Chen:
Characterization of Large Target Sets with Probabilistic Classifiers. IEEE Conf. on Intelligent Systems (1) 2014: 791-800 - [c2]Ray-Ming Chen:
Data-Based Approximation of Fuzzy Target Sets. IEEE Conf. on Intelligent Systems (1) 2014: 801-810 - [c1]Ray-Ming Chen:
PCA-based algorithmic approximation of crisp target sets. UKCI 2014: 1-8 - 2012
- [j1]Ray-Ming Chen, Michael Rathjen:
Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory. Arch. Math. Log. 51(7-8): 789-818 (2012)
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 2025-01-09 13:11 CET 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:
