Shengchun Deng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shengchun Deng has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Xiaofei Xu
Faculty of Computing, Harbin Institute of Technology, Harbin, China
4 shared publications - Zengyou He
School of Software, Dalian University of Technology, Dalian, China
3 shared publications - Haiyan Wu
Zhejiang University of Finance and Economics
1 shared publication Haiyu Song
Zhejiang University of Finance and Economics
1 shared publication- Jiajun Shan
Zhejiang University of Finance and Economics
1 shared publication - Lina Zhou
Harbin Institute of Technology
1 shared publication
Latest Publications
- 3 February 2023
- Published by Springer Nature
- p. 40-50
Syntax-Aware Transformer for Sentence Classification
- 3 February 2023
- Published by Springer Nature
- p. 40-50
Syntax-Aware Transformer for Sentence Classification
- 23 August 2007
- Published by Springer Nature
- p. 441-450
Supply Chain Management System and Interoperability through EAI Platform
- 23 August 2007
- Published by Springer Nature
- p. 441-450
Supply Chain Management System and Interoperability through EAI Platform
- 1 January 2006
- Published by Springer Nature
- p. 296-302
Approximation Algorithms for K-Modes Clustering
- 1 December 2005
- Published by Springer Nature in Neural Processing Letters
- Vol. 22 (3) , 249-262
TCSOM: Clustering Transactions Using Self-Organizing Map
- 1 December 2005
- Published by Springer Nature in Neural Processing Letters
- Vol. 22 (3) , 249-262
TCSOM: Clustering Transactions Using Self-Organizing Map
- 23 August 2005
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 20 (10) , 1077-1089
Scalable algorithms for clustering large datasets with mixed type attributes
Clustering is a widely used technique in data mining applications for discovering patterns in underlying data. Most traditional clustering algorithms are limited to handling datasets that contain either numeric or categorical attributes. However, datasets with mixed types of attributes are common in real life data mining applications. In this article, we present two algorithms that extend the Squeezer algorithm to domains with mixed numeric and categorical attributes. The performance of the two algorithms has been studied on real and artificially generated datasets. Comparisons with other clustering algorithms illustrate the superiority of our approaches. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 1077–1089, 2005.
- 23 August 2005
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 20 (10) , 1077-1089
Scalable algorithms for clustering large datasets with mixed type attributes
Clustering is a widely used technique in data mining applications for discovering patterns in underlying data. Most traditional clustering algorithms are limited to handling datasets that contain either numeric or categorical attributes. However, datasets with mixed types of attributes are common in real life data mining applications. In this article, we present two algorithms that extend the Squeezer algorithm to domains with mixed numeric and categorical attributes. The performance of the two algorithms has been studied on real and artificially generated datasets. Comparisons with other clustering algorithms illustrate the superiority of our approaches. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 1077–1089, 2005.