Learning Order Forest for Qualitative-Attribute Data Clustering
School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China(计算机科学与技术学院,广东工业大学,广州,中国);Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ), Shenzhen, China(人工智能与数字经济广东实验室(深圳));School of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China(计算机科学与软件工程学院,深圳大学,深圳,中国);Fujian Key Laboratory of Sensing and Computing for Smart City, School of Informatics, Xiamen University, China(智能城市感知与计算福建省重点实验室,厦门大学信息学院,中国);Key Laboratory of Multimedia Trusted Perception and Efficient Computing, Ministry of Education of China, Xiamen University, China(多媒体可信感知与高效计算重点实验室,中华人民共和国教育部,厦门大学,中国);Department of Computer Science, Hong Kong Baptist University, Hong Kong, China(计算机科学系,香港 Baptist 大学,香港,中国)
Mingjie Zhao, Sen Feng, Yiqun Zhang, Mengke Li, Yang Lu, Yiu-ming Cheung
Clustering is a fundamental approach to understanding data patterns, wherein the intuitive Euclidean distance space is commonly adopted. However, this is not the case for implicit cluster distributions reflected by qualitative attribute values, e.g., the nominal values of attributes like symptoms, marital status, etc. This paper, therefore, discovered a tree-like distance structure to flexibly represent the local order relationship among intra-attribute qualitative values. That is, treating a value as the vertex of the tree allows to capture rich order relationships among the vertex value and the others. To obtain the trees in a clustering-friendly form, a joint learning mechanism is proposed to iteratively obtain more appropriate tree structures and clusters. It turns out that the latent distance space of the whole dataset can be well-represented by a forest consisting of the learned trees. Extensive experiments demonstrate that the joint learning adapts the forest to the clustering task to yield accurate results. Comparisons of 10 counterparts on 12 real benchmark datasets with significance tests verify the superiority of the proposed method.
Long-Tailed Classification Based on Coarse-Grained Leading Forest and Multi-Center Loss
State Key Laboratory of Public Big Data, Guizhou University(贵州大学公共大数据国家重点实验室);College of Computer and Information Science, Southwest University(西南大学计算机与信息科学学院);Chongqing Key Laboratory of Computational Intelligence, Chongqing University of Posts and Telecommunications(重庆邮电大学重庆市计算智能重点实验室)
Q-Sat AI: Machine Learning-Based Decision Support for Data Saturation in Qualitative Studies
Bolu Abant Izzet Baysal University(博卢阿班特伊泽特·巴伊萨尔大学);Azerbaijan State University of Economics (UNEC)(阿塞拜疆国立经济大学(UNEC));Sakarya University of Applied Science(萨卡里亚应用科学大学)
JD Intelligent Cities Research(京东智能城市研究院);JD Intelligent Cities Business Unit(京东智能城市事业部);University of Science and Technology of China(中国科学技术大学);Beijing Normal University(北京师范大学)