PCA-based dimensionality reduction method for user information in Universal Network

Yu Dai, Jianfeng Guan, Wei Quan, Changqiao Xu, Hongke Zhang
{"title":"PCA-based dimensionality reduction method for user information in Universal Network","authors":"Yu Dai, Jianfeng Guan, Wei Quan, Changqiao Xu, Hongke Zhang","doi":"10.1109/CCIS.2012.6664370","DOIUrl":null,"url":null,"abstract":"Universal Network (UN) is one kind of future Internet architecture. The collection and analysis of user information is a core in the management system of UN. However, users' high-dimensional data affects the performance greatly because it brings in a long response delay when matching user information with strategy rules. An efficient dimensionality reduction method is important to improve the matching efficiency on high-dimensional data. This paper introduces a statistic computational method based on Principal Component Analysis (PCA) for the reduction of user information. The method converts multiple indicators into fewer overall indicators by taking the advantage of the relations among attributes. Then, we apply this algorithm in the user information management system of UN and make several experiments to evaluate and analyze its performance. Experimental results show that the time of querying and matching is reduced by the proposed method on the condition of not losing much information of original attributes. It proves that this method reduces the dimension effectively and can be applied in the high-dimensionality user information management system.","PeriodicalId":392558,"journal":{"name":"2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCIS.2012.6664370","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Universal Network (UN) is one kind of future Internet architecture. The collection and analysis of user information is a core in the management system of UN. However, users' high-dimensional data affects the performance greatly because it brings in a long response delay when matching user information with strategy rules. An efficient dimensionality reduction method is important to improve the matching efficiency on high-dimensional data. This paper introduces a statistic computational method based on Principal Component Analysis (PCA) for the reduction of user information. The method converts multiple indicators into fewer overall indicators by taking the advantage of the relations among attributes. Then, we apply this algorithm in the user information management system of UN and make several experiments to evaluate and analyze its performance. Experimental results show that the time of querying and matching is reduced by the proposed method on the condition of not losing much information of original attributes. It proves that this method reduces the dimension effectively and can be applied in the high-dimensionality user information management system.
基于pca的通用网络用户信息降维方法
通用网络(UN)是一种未来的互联网架构。用户信息的收集和分析是联合国管理系统的核心。然而,用户的高维数据在匹配用户信息和策略规则时会带来较长的响应延迟,对性能影响很大。有效的降维方法是提高高维数据匹配效率的重要手段。介绍了一种基于主成分分析(PCA)的用户信息约简统计计算方法。该方法利用属性之间的关系,将多个指标转化为更少的整体指标。然后,我们将该算法应用于联合国用户信息管理系统中,并进行了多次实验来评估和分析其性能。实验结果表明,该方法在不丢失大量原始属性信息的情况下,减少了查询和匹配的时间。实验证明,该方法有效地降低了用户信息的维数,可以应用于高维用户信息管理系统中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信