default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaojin Lin
- > Home > Persons > Yaojin Lin
Publications
- 2024
[j88]Haoran Su
, Jinkun Chen, Yaojin Lin:
A four-stage branch local search algorithm for minimal test cost attribute reduction based on the set covering. Appl. Soft Comput. 153: 111303 (2024)- [j81]Yaojin Lin, Yulin Li, Chenxi Wang, Lei Guo, Jinkun Chen:
Label Distribution Learning Based on Horizontal and Vertical Mining of Label Correlations. IEEE Trans. Big Data 10(3): 275-287 (2024) - 2023
- [j72]Haoyang Liu, Yaojin Lin, Chenxi Wang, Lei Guo, Jinkun Chen:
Semantic-gap-oriented feature selection in hierarchical classification learning. Inf. Sci. 642: 119241 (2023) - 2022
- [j56]Jie Wang, Yaojin Lin, Longzhu Li, Yun-an Wang, Meiyan Xu, Jinkun Chen:
Multi-label causal feature selection based on neighbourhood mutual information. Int. J. Mach. Learn. Cybern. 13(11): 3509-3522 (2022) - [j54]Jinkun Chen, Yaojin Lin, Jusheng Mi, Shaozi Li, Weiping Ding:
A Spectral Feature Selection Approach With Kernelized Fuzzy Rough Sets. IEEE Trans. Fuzzy Syst. 30(8): 2886-2901 (2022) - 2021
- [j51]Shengxing Bai, Yaojin Lin, Yan Lv, Jinkun Chen, Chenxi Wang:
Kernelized fuzzy rough sets based online streaming feature selection for large-scale hierarchical classification. Appl. Intell. 51(3): 1602-1615 (2021) - [j50]Longzhu Li, Yaojin Lin, Hong Zhao, Jinkun Chen, Shaozi Li:
Causality-based online streaming feature selection. Concurr. Comput. Pract. Exp. 33(20) (2021) - [j44]Jinkun Chen, Jusheng Mi, Bin Xie, Yaojin Lin:
Attribute reduction in formal decision contexts and its application to finite topological spaces. Int. J. Mach. Learn. Cybern. 12(1): 39-52 (2021) - 2020
- [j43]Jinkun Chen, Jusheng Mi, Yaojin Lin:
A graph approach for fuzzy-rough feature selection. Fuzzy Sets Syst. 391: 96-116 (2020) - 2019
- [j41]Jinkun Chen, Ju-Sheng Mi, Bin Xie, Yaojin Lin:
A fast attribute reduction method for large formal decision contexts. Int. J. Approx. Reason. 106: 1-17 (2019) - 2018
- [j35]Jinkun Chen, Ju-Sheng Mi, Yaojin Lin:
A graph approach for knowledge reduction in formal contexts. Knowl. Based Syst. 148: 177-188 (2018) - [j34]Yaojin Lin, Yuwen Li, Chenxi Wang, Jinkun Chen:
Attribute reduction for multi-label learning with fuzzy rough set. Knowl. Based Syst. 152: 51-61 (2018) - [j32]Yaojin Lin, Huihuang Chen, Guoping Lin, Jinkun Chen, Zhouming Ma, Jinjin Li:
Synthesizing decision rules from multiple information sources: a neighborhood granulation viewpoint. Int. J. Mach. Learn. Cybern. 9(11): 1919-1928 (2018) - 2017
- [j25]Jinkun Chen, Yaojin Lin, Guoping Lin, Jinjin Li, Yan-Lan Zhang:
Attribute reduction of covering decision systems by hypergraph model. Knowl. Based Syst. 118: 93-104 (2017) - 2016
- [j19]Yaojin Lin, Qinghua Hu, Jinghua Liu, Jinkun Chen, Jie Duan:
Multi-label feature selection based on neighborhood mutual information. Appl. Soft Comput. 38: 244-256 (2016) - [j18]Jinkun Chen, Yaojin Lin, Jinjin Li, Guoping Lin, Zhouming Ma, Anhui Tan:
A rough set method for the minimum vertex cover problem of graphs. Appl. Soft Comput. 42: 360-367 (2016) - 2015
- [j12]Jinkun Chen, Jinjin Li, Yaojin Lin, Guoping Lin, Zhouming Ma:
Relations of reduction between covering generalized rough sets and concept lattices. Inf. Sci. 304: 16-27 (2015) - [j10]Jinkun Chen, Yaojin Lin, Guoping Lin, Jinjin Li, Zhouming Ma:
The relationship between attribute reducts in rough sets and minimal vertex covers of graphs. Inf. Sci. 325: 87-97 (2015) - 2014
- [j5]Yaojin Lin, Jinjin Li, Menglei Lin, Jinkun Chen:
A new nearest neighbor classifier via fusing neighborhood information. Neurocomputing 143: 164-169 (2014) - [j4]Yaojin Lin, Jinjin Li, Peirong Lin, Guoping Lin, Jinkun Chen:
Feature selection via neighborhood multi-granulation fusion. Knowl. Based Syst. 67: 162-168 (2014) - 2013
- [j2]Jinkun Chen, Jinjin Li, Yaojin Lin:
Computing connected components of simple undirected graphs based on generalized rough sets. Knowl. Based Syst. 37: 80-85 (2013) - [j1]Jinkun Chen, Jinjin Li, Yaojin Lin:
On the structure of definable sets in covering approximation spaces. Int. J. Mach. Learn. Cybern. 4(3): 195-206 (2013)
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-09-19 00:33 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:
