default search action
Duanbing Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Yi Gan, Zhihui Su, Gaoyong Lu, Pengju Zhang, Aixiang Cui, Jiawei Jiang, Duanbing Chen:
Entity type inference based on path walking and inter-types relationships. Data Knowl. Eng. 153: 102337 (2024) - [j20]Hong-Liang Sun
, Duan-Bing Chen
A robust ranking method for online rating systems with spammers by interval division. Expert Syst. Appl. 235: 121236 (2024) - [c6]Jianyu Xie
SwapTrack: Enhancing RGB-T Tracking via Learning from Paired and Single-Modal Data. CVIPPR 2024: 56 - 2023
- [j19]Shengzhao Tian
Joint learning model for underwater acoustic target recognition. Knowl. Based Syst. 260: 110119 (2023) - [j18]Zhouyang Xie
Joint Gaussian mixture model for versatile deep visual model explanation. Knowl. Based Syst. 280: 110989 (2023) - [c5]Qi Zhang
Quality Prediction of Brewing Koji based on Multitask Learning. IoTAAI 2023: 47-53 - 2022
- [j17]Jingfa Liu, Yi Dong, Zhaoxia Liu, Duanbing Chen:
Applying ontology learning and multi-objective ant colony optimization method for focused crawling to meteorological disasters domain knowledge. Expert Syst. Appl. 198: 116741 (2022) - [i19]Enyu Yu, Duanbing Chen, Yan Fu, Yuanyuan Xu:
Identifying critical nodes in complex networks by graph representation learning. CoRR abs/2201.07988 (2022) - [i18]Tao Zhou, Yan-Li Lee, Qian Li, Duanbing Chen, Wenbo Xie, Tong Wu, Tu Zeng:
Identifying discreditable firms in a large-scale ownership network. CoRR abs/2211.14316 (2022) - 2021
- [j16]Hong-Liang Sun, Kai-Ping Liang, Hao Liao, Duan-Bing Chen:
Evaluating user reputation of online rating systems by rating statistical patterns. Knowl. Based Syst. 219: 106895 (2021) - [i17]Enyu Yu, Yan Fu, Junlin Zhou, Hong-Liang Sun, Duan-Bing Chen:
Predicting Critical Nodes in Temporal Networks by Dynamic Graph Convolutional Networks. CoRR abs/2106.10419 (2021) - [i16]Enyu Yu, Yan Fu, Junlin Zhou, Hong-Liang Sun, Duan-Bing Chen:
Finding critical edges in complex networks through local information. CoRR abs/2106.10420 (2021) - [i15]Zhouyang Xie, Yan Fu, Shengzhao Tian, Junlin Zhou, Duanbing Chen:
Pruning with Compensation: Efficient Channel Pruning for Deep Convolutional Neural Networks. CoRR abs/2108.13728 (2021) - 2020
- [j15]Enyu Yu
A Re-Ranking Algorithm for Identifying Influential Nodes in Complex Networks. IEEE Access 8: 211281-211290 (2020) - [j14]Chungu Guo, Liangwei Yang
Influential Nodes Identification in Complex Networks via Information Entropy. Entropy 22(2): 242 (2020) - [j13]Wen-Bo Xie
Hierarchical clustering supported by reciprocal nearest neighbors. Inf. Sci. 527: 279-292 (2020) - [j12]Enyu Yu, Yue-Ping Wang, Yan Fu, Duan-Bing Chen, Mei Xie:
Identifying critical nodes in complex networks via graph convolutional networks. Knowl. Based Syst. 198: 105893 (2020) - [j11]Guang Li
Deep Anomaly Detection for CNC Machine Cutting Tool Using Spindle Current Signals. Sensors 20(17): 4896 (2020)
2010 – 2019
- 2019
- [i14]Wen-Bo Xie, Yan-Li Lee, Cong Wang, Duan-Bing Chen, Tao Zhou:
Hierarchical Clustering Supported by Reciprocal Nearest Neighbors. CoRR abs/1907.04915 (2019) - 2018
- [j10]Renfeng Yang, Wen-Bo Xie
A three-layer model on users' interests mining. J. Inf. Sci. 44(1): 136-144 (2018) - [j9]Liang Yin, Mingli He, Wenbo Xie, Duanbing Chen:
装备-标准知识图谱的过程建模研究 (Process Modeling on Knowledge Graph of Equipment and Standard). 计算机科学 45(6A): 502-505 (2018) - [c4]Guang Li, Xin Yang, Duanbing Chen, Anxing Song, Yu Ke Fang, Junlin Zhou:
Tool Breakage Detection using Deep Learning. BCD 2018: 37-42 - [i13]Guang Li, Xin Yang, Duanbing Chen, Anxing Song, Yu Ke Fang, Junlin Zhou:
Tool Breakage Detection using Deep Learning. CoRR abs/1808.05347 (2018) - 2017
- [i12]Liang Yin, Li-Chen Shi, Jun-Yan Zhao, Song-Yang Du, Wen-Bo Xie, Duan-Bing Chen:
Heterogeneous information network model for equipment-standard system. CoRR abs/1703.02314 (2017) - 2016
- [i11]Jian-Xiong Zhang, Duan-Bing Chen, Qiang Dong, Zhi-Dan Zhao:
Identifying a set of influential spreaders in complex networks. CoRR abs/1602.00070 (2016) - [i10]Linyuan Lü, Duanbing Chen, Xiao-Long Ren, Qian-Ming Zhang, Yi-Cheng Zhang, Tao Zhou:
Vital nodes identification in complex networks. CoRR abs/1607.01134 (2016) - 2014
- [j8]Hui Gao, Duanbing Chen, Guan-nan Wang
A continuous rating model for news recommendation. J. Inf. Sci. 40(5): 568-577 (2014) - [i9]Xiang-Yu Zhao, Bin Huang, Ming Tang, Hai-Feng Zhang, Duan-Bing Chen:
Identifying effective multiple spreaders by coloring complex networks. CoRR abs/1410.1972 (2014) - 2013
- [j7]Giulio Cimini
The Role of Taste Affinity in Agent-Based Models for Social Recommendation. Adv. Complex Syst. 16(4-5) (2013) - [i8]Giulio Cimini, An Zeng, Matús Medo, Duanbing Chen:
The role of taste affinity in agent-based models for social recommendation. CoRR abs/1301.4417 (2013) - [i7]Duanbing Chen, Rui Xiao, An Zeng, Yi-Cheng Zhang:
Path diversity improves the identification of influential spreaders. CoRR abs/1305.7480 (2013) - [i6]Qian Li, Tao Zhou, Linyuan Lu, Duanbing Chen:
Identifying Influential Spreaders by Weighted LeaderRank. CoRR abs/1306.5042 (2013) - 2012
- [j6]Wenqi Huang, Tao Ye, Duanbing Chen:
Corner occupying theorem for the two-dimensional integral rectangle packing problem. Sci. China Inf. Sci. 55(11): 2466-2472 (2012) - [i5]Duanbing Chen, An Zeng, Giulio Cimini, Yi-Cheng Zhang:
Adaptive social recommendation in a multiple category landscape. CoRR abs/1210.1441 (2012) - 2011
- [i4]Linyuan Lu, Duanbing Chen, Tao Zhou:
Small world yields the most effective information spreading. CoRR abs/1107.0429 (2011) - [i3]Wenqi Huang, Tao Ye, Duanbing Chen:
Bottom-Left Placement Theorem for Rectangle Packing. CoRR abs/1107.4463 (2011) - [i2]Duanbing Chen, Giulio Cimini, Linyuan Lu, Matús Medo, Yi-Cheng Zhang, Tao Zhou:
Adaptive topology evolution in information-sharing social networks. CoRR abs/1107.4491 (2011) - [i1]Wenqi Huang, Tao Ye, Duanbing Chen:
Corner Occupying Theorem for the Two-dimensional Integral Rectangle Packing Problem. CoRR abs/1111.3715 (2011) - 2010
- [j5]Jingfa Liu, Gang Li, Duanbing Chen, Wenjie Liu, Yali Wang:
Two-dimensional equilibrium constraint layout using simulated annealing. Comput. Ind. Eng. 59(4): 530-536 (2010) - [j4]Duanbing Chen, Jingfa Liu, Yan Fu, Mingsheng Shang:
An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem. Comput. Oper. Res. 37(6): 1068-1074 (2010)
2000 – 2009
- 2009
- [c3]Jie Liu, Mingsheng Shang, Duanbing Chen:
Personal Recommendation Based on Weighted Bipartite Networks. FSKD (5) 2009: 134-137 - 2008
- [c2]Aixiang Cui, Duanbing Chen, Yan Fu:
Community Detection Based on Weighted Networks. NPC Workshops 2008: 273-280 - [c1]Ying Wan, Duanbing Chen, Yan Fu:
A New Efficient Algorithm for Detecting Communities in Complex Networks. NPC Workshops 2008: 281-286 - 2007
- [j3]Duanbing Chen, Wenqi Huang:
A New Heuristic Algorithm for Constrained Rectangle-Packing Problem. Asia Pac. J. Oper. Res. 24(4): 463-478 (2007) - [j2]Wenqi Huang, Duanbing Chen, Ruchu Xu:
A new heuristic algorithm for rectangle packing. Comput. Oper. Res. 34(11): 3270-3280 (2007) - [j1]Wenqi Huang, Duanbing Chen:
An efficient heuristic algorithm for rectangle-packing problem. Simul. Model. Pract. Theory 15(10): 1356-1365 (2007)
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-09-18 00:16 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: