default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLankun Guo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Lankun Guo, Zhenhua Jia
, Guozhi Ma, Jinhai Li:
An iterative recommendation model of supporting personalized learning based on schematic patterns mining from schema-enhanced contexts of problem-solving. Int. J. Mach. Learn. Cybern. 14(1): 93-115 (2023)- 2022
- [j22]Lankun Guo, Zhenhua Jia, Qingguo Li, Jianhua Dai:
Steadiness analysis of means-end conceptual paths and problem-chains based on concept lattices and similarity measuring. Int. J. Mach. Learn. Cybern. 13(3): 691-719 (2022) - 2021
- [j21]Longchun Wang, Lankun Guo, Qingguo Li:
Continuous Domains in Formal Concept Analysis. Fundam. Informaticae 179(3): 295-319 (2021)
2010 – 2019
- 2019
- [j20]Bin Yu, Lankun Guo, Qingguo Li:
A characterization of novel rough fuzzy sets of information systems and their application in decision making. Expert Syst. Appl. 122: 253-261 (2019) - [j19]Lankun Guo, Qingguo Li, Guo-Qiang Zhang:
A representation of continuous domains via relationally approximable concepts in a generalized framework of formal concept analysis. Int. J. Approx. Reason. 114: 29-43 (2019) - [c6]Guozhi Ma, Lankun Guo, Cheng Yang:
A Characterization Theorem for Continuous Lattices by Closure Spaces. ICFCA 2019: 324-331 - [i2]Longchun Wang, Lankun Guo, Qingguo Li:
Continuous Domains in Formal Concept Analysis. CoRR abs/1912.04496 (2019) - 2018
- [j18]Lankun Guo, Qingguo Li, Lingjuan Yao:
Locally complete consistent F-augmented contexts: A category-theoretic representation of algebraic L-domains. Discret. Appl. Math. 249: 53-63 (2018) - [j17]Xiaokun Huang, Qingguo Li, Lankun Guo:
The TL-fuzzy rough approximation operators on a lattice. Soft Comput. 22(1): 17-29 (2018) - 2017
- [j16]Jia-Liang Xie, Qingguo Li, Chongxia Lu, Lankun Guo, Shui-Li Chen:
Extension of a class of decomposable measures via generalized pseudo-metrics. Fuzzy Sets Syst. 327: 7-20 (2017) - [j15]Lankun Guo, Qingguo Li, Petko Valtchev, Yaping Lin:
Representation of algebraic domains by formal association rule systems. Math. Struct. Comput. Sci. 27(4): 470-490 (2017) - 2016
- [j14]Lankun Guo, Qingguo Li, Guo-Qiang Zhang:
A Note on L-fuzzy Closure Systems. Int. J. Fuzzy Syst. 18(1): 110-118 (2016) - [j13]Hongxia Han, Qingguo Li, Lankun Guo:
Rough approximations via ideal on a complete completely distributive lattice. Soft Comput. 20(5): 1853-1861 (2016) - [j12]Mingyuan Wu, Lankun Guo, Qingguo Li:
A representation of L-domains by information systems. Theor. Comput. Sci. 612: 126-136 (2016) - 2015
- [j11]Guangming Lang, Qingguo Li, Lankun Guo:
Homomorphisms Between Covering Approximation Spaces. Fundam. Informaticae 138(3): 351-371 (2015) - [j10]Guangming Lang, Qingguo Li, Lankun Guo:
Homomorphisms-based attribute reduction of dynamic fuzzy covering information systems. Int. J. Gen. Syst. 44(7-8): 791-811 (2015) - [j9]Lankun Guo, Qingguo Li:
The Categorical Equivalence Between Algebraic Domains and F-Augmented Closure Spaces. Order 32(1): 101-116 (2015) - 2014
- [j8]Lankun Guo, Qingguo Li, Mengqiao Huang:
A categorical representation of algebraic domains based on variations of rough approximable concepts. Int. J. Approx. Reason. 55(3): 885-895 (2014) - [j7]Qimei Xiao, Qingguo Li, Lankun Guo:
Rough sets induced by ideals in lattices. Inf. Sci. 271: 82-92 (2014) - [j6]Lankun Guo, Qingguo Li, Xiaodong Jia:
On the order-theoretic properties of lower concept formula systems. Soft Comput. 18(2): 207-216 (2014) - 2013
- [j5]Qingguo Li, Lankun Guo:
Formal query systems on contexts and a representation of algebraic lattices. Inf. Sci. 239: 72-84 (2013) - [j4]Guangming Lang, Qingguo Li, Lankun Guo:
Discernibility matrix simplification with new attribute dependency functions for incomplete information systems. Knowl. Inf. Syst. 37(3): 611-638 (2013) - [c5]Lankun Guo, Qingguo Li, Petko Valtchev, Robert Godin:
Formal $\mathcal{F}$ -contexts and Their Induced Implication Rule Systems. ICFCA 2013: 141-155 - [c4]Lankun Guo, Qingguo Li, Petko Valtchev, Robert Godin:
A Note on Finitely Derived Information Systems. ISDT 2013: 49-59 - [c3]Mengqiao Huang, Qingguo Li, Lankun Guo:
Formal Contexts for Algebraic Domains. ISDT 2013: 79-90 - 2012
- [j3]Xiaoqiang Zhou, Qingguo Li, Lankun Guo:
On Generalised Interval-Valued Fuzzy Soft Sets. J. Appl. Math. 2012: 479783:1-479783:18 (2012) - [i1]Guangming Lang, Qingguo Li, Lankun Guo:
A new fuzzy rough sets based on fuzzy coverings. CoRR abs/1204.0072 (2012) - 2011
- [j2]Lankun Guo, Fangping Huang, Qingguo Li, Guo-Qiang Zhang:
Power contexts and their concept lattices. Discret. Math. 311(18-19): 2049-2063 (2011) - [j1]Lankun Guo, Guo-Qiang Zhang, Qingguo Li:
Fuzzy closure systems on L - ordered sets. Math. Log. Q. 57(3): 281-291 (2011) - [c2]Lankun Guo, Qingguo Li, Hongping Liu:
A new framework of fuzzy concept analysis. FSKD 2011: 30-34 - [c1]Hongping Liu, Qingguo Li, Lankun Guo:
Weak Approximable Concepts and Completely Algebraic Lattices. NL-MUA 2011: 683-689
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-08-05 20:26 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:
