基于 Manifold Distance 的网络数据挖掘算法,适用于云服务架构中的混合数据

Pub Date : 2024-05-22 DOI:10.4018/ijcini.344021
Hui Wang, Tie Cai, Dongsheng Cheng, Kangshun Li, Guangming Lin, Zhijian Wu
{"title":"基于 Manifold Distance 的网络数据挖掘算法,适用于云服务架构中的混合数据","authors":"Hui Wang, Tie Cai, Dongsheng Cheng, Kangshun Li, Guangming Lin, Zhijian Wu","doi":"10.4018/ijcini.344021","DOIUrl":null,"url":null,"abstract":"Due to the complex distribution of web data and frequent updates under the cloud service architecture, the existing methods for global consistency of data ignore the global consistency of distance measurement and the inability to obtain neighborhood information of data. To overcome these problems, we transform the multi-information goal and multi-user demand (constraint conditions) in web data mining into a constrained multi-objective optimization model and solve it by a constrained particle swarm multi-objective optimization algorithm. While we measure the distance between data by manifold distance. In order to make it easier for the constrained multi-objective particle swarm algorithm to solve different types of problems to find an effective solution set closer to the real Pareto front, a new manifold learning algorithm based on the constrained multi-objective particle swarm algorithm is built and used to solve this problem. Experiments results demonstrate that this can improve the service efficiency of cloud computing.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Web Data Mining Algorithm Based on Manifold Distance for Mixed Data in Cloud Service Architecture\",\"authors\":\"Hui Wang, Tie Cai, Dongsheng Cheng, Kangshun Li, Guangming Lin, Zhijian Wu\",\"doi\":\"10.4018/ijcini.344021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the complex distribution of web data and frequent updates under the cloud service architecture, the existing methods for global consistency of data ignore the global consistency of distance measurement and the inability to obtain neighborhood information of data. To overcome these problems, we transform the multi-information goal and multi-user demand (constraint conditions) in web data mining into a constrained multi-objective optimization model and solve it by a constrained particle swarm multi-objective optimization algorithm. While we measure the distance between data by manifold distance. In order to make it easier for the constrained multi-objective particle swarm algorithm to solve different types of problems to find an effective solution set closer to the real Pareto front, a new manifold learning algorithm based on the constrained multi-objective particle swarm algorithm is built and used to solve this problem. Experiments results demonstrate that this can improve the service efficiency of cloud computing.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/ijcini.344021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijcini.344021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于云服务架构下网络数据分布复杂、更新频繁,现有的数据全局一致性方法忽视了距离测量的全局一致性,无法获取数据的邻域信息。为了克服这些问题,我们将网络数据挖掘中的多信息目标和多用户需求(约束条件)转化为约束多目标优化模型,并采用约束粒子群多目标优化算法进行求解。我们用流形距离来衡量数据之间的距离。为了使约束多目标粒子群算法更容易解决不同类型的问题,找到更接近真实帕累托前沿的有效解集,我们建立了一种基于约束多目标粒子群算法的新流形学习算法,并将其用于解决该问题。实验结果表明,这可以提高云计算的服务效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
分享
查看原文
A Web Data Mining Algorithm Based on Manifold Distance for Mixed Data in Cloud Service Architecture
Due to the complex distribution of web data and frequent updates under the cloud service architecture, the existing methods for global consistency of data ignore the global consistency of distance measurement and the inability to obtain neighborhood information of data. To overcome these problems, we transform the multi-information goal and multi-user demand (constraint conditions) in web data mining into a constrained multi-objective optimization model and solve it by a constrained particle swarm multi-objective optimization algorithm. While we measure the distance between data by manifold distance. In order to make it easier for the constrained multi-objective particle swarm algorithm to solve different types of problems to find an effective solution set closer to the real Pareto front, a new manifold learning algorithm based on the constrained multi-objective particle swarm algorithm is built and used to solve this problem. Experiments results demonstrate that this can improve the service efficiency of cloud computing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
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学术官方微信