default search action
Honghai Feng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c16]Jun Li, Honghai Feng, Pengcheng Zhou, Ruihui Hou, Yaju Wei, Yanyan Chen:
Construction of disease-pathological feature knowledge graph based on entity recognition and relation extraction. CSCI 2022: 1622-1627 - 2020
- [c15]Ruihui Hou, Hanhao Li, Honghai Feng, Yunpeng Li, Jun Li, Yatian Shen:
An entity relation extraction algorithm based on BERT(wwm-ext)-BiGRU-Attention. CIAT 2020: 130-135 - [c14]Yaju Wei, Hanhao Li, Honghai Feng, Pengcheng Zhou, Xuzhao Lu, Yatian Shen:
Simultaneous learning algorithm for multiple sets of synonyms with different semantics. CIAT 2020: 143-147
2010 – 2019
- 2014
- [c13]Honghai Feng, Yanyan Chen, Kaiwei Zou, Lijuan Liu, Qiannan Zhu, Zhuo Ran, Li Yao, Lijin Ji, Sai Liu:
A New Rough Set Based Classification Rule Generation Algorithm(RGA). IEA/AIE (1) 2014: 369-378
2000 – 2009
- 2006
- [c12]Honghai Feng, Hao Xu, Baoyan Liu, Bingru Yang, Zhuye Gao, Yueli Li:
Using Rough Set to Find the Factors That Negate the Typical Dependency of a Decision Attribute on Some Condition Attributes. IDEAL 2006: 713-720 - [c11]Honghai Feng, Zhao Shuo, Baoyan Liu, Liyun He, Bingru Yang, Yueli Li:
Using Positive Region to Reduce the Computational Complexity of Discernibility Matrix Method. IEA/AIE 2006: 1290-1298 - [c10]Honghai Feng, Baoyan Liu, Liyun He, Bingru Yang, Yumei Chen, Zhao Shuo:
Using Rough Set to Induce All Kinds of Positive Region Knowledge and It's use in SARS Data Set. ICDM (Posters) 2006: 244-252 - [c9]Honghai Feng, Baoyan Liu, Liyun He, Bingru Yang, Yumei Chen, Zhao Shuo:
An Algorithm for Eliminating the Inconsistencies Caused During Discretization. KES (1) 2006: 145-152 - [c8]Honghai Feng, Baoyan Liu, Liyun He, Bingru Yang, Yueli Li, Zhao Shuo:
Using Rough Set to Induce More Abstract Rules from Rule Base. KES (1) 2006: 498-505 - [c7]Honghai Feng, Hao Xu, Baoyan Liu, Liyun He, Bingru Yang, Yueli Li:
Algorithms for Finding and Correcting Four Kinds of Data Mistakes in Information Table. KES (1) 2006: 714-719 - [c6]Honghai Feng, Baoyan Liu, Liyun He, Bingru Yang, Yueli Li:
A Discretization Algorithm That Keeps Positive Regions of All the Decision Classes. KES (1) 2006: 1029-1036 - 2005
- [c5]Honghai Feng, Baoyan Liu, Liyun He, Bingru Yang, Huang Yong:
A Rough Set Based Algorithm for Handling Information Systems where there are a Large Number of Missing Values. IICAI 2005: 2411-2419 - [c4]Honghai Feng, Baoyan Liu, Liyun He:
Using rough set to induce dependencies between attributes where there are a large amount of missing values: a SARS data application. K-CAP 2005: 201-202 - [c3]Honghai Feng, Yin Cheng, Mingyi Liao, Bingru Yang, Yumei Chen:
Using Rough Set to Induce Comparative Knowledge and Its Use in SARS Data. KES (4) 2005: 89-93 - [c2]Honghai Feng, Baoyan Liu, Yin Cheng, Ping Li, Bingru Yang, Yumei Chen:
Using Rough Set to Reduce SVM Classifier Complexity and Its Use in SARS Data Set. KES (3) 2005: 575-580 - [c1]Honghai Feng, Chen Guoshun, Yin Cheng, Bingru Yang, Yumei Chen:
A SVM Regression Based Approach to Filling in Missing Values. KES (3) 2005: 581-587
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-25 05:59 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: