An unsupervised feature extraction and fusion framework for multi-source data based on copula theory

IF 3.2 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xiuwei Chen, Li Lai, Maokang Luo
{"title":"An unsupervised feature extraction and fusion framework for multi-source data based on copula theory","authors":"Xiuwei Chen,&nbsp;Li Lai,&nbsp;Maokang Luo","doi":"10.1016/j.ijar.2025.109384","DOIUrl":null,"url":null,"abstract":"<div><div>With the development of big data technology, people are increasingly facing the challenge of dealing with massive amounts of multi-source or multi-sensor data. Therefore, it becomes crucial to extract valuable information from such data. Information fusion techniques provide effective solutions for handling multi-source data and can be categorized into three levels: data-level fusion, feature-level fusion, and decision-level fusion. Feature-level fusion combines features from multiple sources to create a consolidated feature, enhancing information richness. This paper proposes an unsupervised feature extraction and fusion method for multi-source data that utilizes the R-Vine copula, denoted as CF. The method starts by performing kernel density estimation to extract each data source's marginal density and distribution. Next, the maximum spanning tree is employed to select a vine structure for each attribute, and the corresponding copulas are chosen using maximum likelihood estimation and the AIC criterion. The joint probability density of each attribute across all information sources can be obtained by utilizing the relevant vine structure and copulas, serving as the final fusion feature. Finally, the proposed method is evaluated on eighteen simulated datasets and six real datasets. The results indicate that compared to several state-of-the-art fusion methods, the CF method can significantly enhance the classification accuracy of popular classifiers such as KNN, SVM, and Logistic Regression.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"180 ","pages":"Article 109384"},"PeriodicalIF":3.2000,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X25000258","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

With the development of big data technology, people are increasingly facing the challenge of dealing with massive amounts of multi-source or multi-sensor data. Therefore, it becomes crucial to extract valuable information from such data. Information fusion techniques provide effective solutions for handling multi-source data and can be categorized into three levels: data-level fusion, feature-level fusion, and decision-level fusion. Feature-level fusion combines features from multiple sources to create a consolidated feature, enhancing information richness. This paper proposes an unsupervised feature extraction and fusion method for multi-source data that utilizes the R-Vine copula, denoted as CF. The method starts by performing kernel density estimation to extract each data source's marginal density and distribution. Next, the maximum spanning tree is employed to select a vine structure for each attribute, and the corresponding copulas are chosen using maximum likelihood estimation and the AIC criterion. The joint probability density of each attribute across all information sources can be obtained by utilizing the relevant vine structure and copulas, serving as the final fusion feature. Finally, the proposed method is evaluated on eighteen simulated datasets and six real datasets. The results indicate that compared to several state-of-the-art fusion methods, the CF method can significantly enhance the classification accuracy of popular classifiers such as KNN, SVM, and Logistic Regression.
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning 工程技术-计算机:人工智能
CiteScore
6.90
自引率
12.80%
发文量
170
审稿时长
67 days
期刊介绍: The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest. Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning. Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信