检索结果-内蒙古大学图书馆

Collaborative filtering recommendation algorithm integrating user similarity and trust

Journal of Physics: Conference Series 2021年第1期2010卷

作者： Mengge Huang Kai Cao Jingyi Zhang Chuanlin Zhang Tao Deng Key Laboratory of China's Ethnic Languages and Information Technology of Ministry of Education Northwest Minzu University Lanzhou 730030 P. R. China Key Laboratory of Streaming Data Computing Technologies and Application Northwest Minzu University Lanzhou 730030 P. R. China School of Mathematics and Computer Science Northwest Minzu University Lanzhou 730030 P. R. China

The rapid development of the Internet has brought convenience to people and has also produced the problem of 'information overload'. In view of the traditional collaborative filtering algorithm facing some bottlenecks to be solved, this study proposes a collaborative filtering algorithm that combines similarity and trust. First of all, in view of the large deviation of traditional similarity calculation and prediction of user ratings, this study proposes an optimized Pearson correlation coefficient calculation method; secondly, the trust relationship is established based on the user's rating of the common project, and the trust relationship between users who do not have a direct trust relationship is established through the transfer of trust; then find the nearest neighbor set of the target user through the fusion of user similarity and trust; finally, the item is scored and predicted to generate a recommendation list. Experimental results show that the algorithm proposed in this study can effectively improve the accuracy of recommendation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis of SET pulses propagation probabilities in sequential circuits

Analysis of SET pulses propagation probabilities in sequenti...

引用

2017年第二届可靠性工程国际会议

作者： Shuo Cai Fei Yu Yiqun Yang School of Computer and Communication Engineering Changsha University of Science and Technology Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology

As the feature size of CMOS transistors scales down, single event transient（SET） has been an important consideration in designing logic circuits. Many researches have been done in analyzing the impact of SET. However, it is difficult to consider numerous factors. We present a new approach for analyzing the SET pulses propagation probabilities（SPPs）. It considers all masking effects and uses SET pulses propagation probabilities matrices（SPPMs） to represent the SPPs in current cycle. Based on the matrix union operations, the SPPs in consecutive cycles can be calculated. Experimental results show that our approach is practicable and efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Strict pattern matching under non-overlapping condition

引用

science China(Information sciences) 2017年第1期60卷 5-20页

作者： Youxi WU Cong SHEN He JIANG Xindong WU School of Computer Science and Engineering Hebei University of Technology Hebei Province Key Laboratory of Big Data Calculation School of Computer Science and Technology Tianjin University School of Software Dalian University of Technology School of Computer Science and Information Engineering Hefei University of Technology School of Computing and Informatics University of Louisiana at Lafayette

Pattern matching(or string matching) is an essential task in computer science, especially in sequential pattern mining, since pattern matching methods can be used to calculate the support(or the number of occurrences) of a pattern and then to determine whether the pattern is frequent or not. A state-of-the-art sequential pattern mining with gap constraints(or flexible wildcards) uses the number of non-overlapping occurrences to denote the frequency of a pattern. Non-overlapping means that any two occurrences cannot use the same character of the sequence at the same position of the pattern. In this paper, we investigate strict pattern matching under the non-overlapping condition. We show that the problem is in P at first. Then we propose an algorithm, called NETLAP-Best, which uses Nettree structure. NETLAP-Best transforms the pattern matching problem into a Nettree and iterates to find the rightmost root-leaf path, to prune the useless nodes in the Nettree after removing the rightmost root-leaf path. We show that NETLAP-Best is a complete algorithm and analyse the time and space complexities of the algorithm. Extensive experimental results demonstrate the correctness and efficiency of NETLAP-Best.

关键词： pattern matching sequential pattern mining gap constraint flexible wildcard non-overlapping occurrence Nettree

来源：评论

学校读者我要写书评

暂无评论

Trajectory data privacy protection based on differential privacy mechanism

Trajectory data privacy protection based on differential pri...

引用

2017年第二届可靠性工程国际会议

作者： Ke Gu Lihao Yang Yongzhi Liu Niandong Liao School of Computer and Communication Engineering Changsha University of Science and Technology Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology

In this paper, we propose a trajectory data privacy protection scheme based on differential privacy mechanism. In the proposed scheme, the algorithm first selects the protected points from the user’s trajectory data;secondly, the algorithm forms the polygon according to the protected points and the adjacent and high frequent accessed points that are selected from the accessing point database, then the algorithm calculates the polygon centroids;finally, the noises are added to the polygon centroids by the differential privacy method, and the polygon centroids replace the protected points, and then the algorithm constructs and issues the new trajectory data. The experiments show that the running time of the proposed algorithms is fast, the privacy protection of the scheme is effective and the data usability of the scheme is higher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BanFEL: A Blockchain Based Smart Contract for Fair and Efficient Lottery Scheme

BanFEL: A Blockchain Based Smart Contract for Fair and Effic...

引用

IEEE Conference on Dependable and Secure computing

作者： Jiasheng Li Zijian Zhang Meng Li Beijing Engineering Research Center of Massive Language Information Beijing Institute of Technology Beijing China School of Computer Science University of Auckland Aukland New Zealand Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Hefei University of Technology Anhui China

Lottery is a game with many people's dreams. But corruptions of lottery centers make the lottery unfair. To address this unfair issue, fair lottery schemes have been studied for several years. In these schemes, delay functions or aggregation protocols can be used to generate the winning numbers fairly. However, to the best of our knowledge, none of the existing schemes can achieve the winning number generated randomly, while the randomness can be verified fairly. In this article, we first propose a [B]lockchain based sm[a]rt co[n]tract for [F]air and [E]fficient [L]ottery (BanFEL) scheme. We further present a winning number random generation smart contract, by which players submit the purchased numbers and the non-tampering property is protected. Security analysis and experiments show that the fairness of BanFEL is protected better than the existing works. Meanwhile, the verification cost of this scheme are at least 0.03s lower than the traditional Grumbach's scheme between 1000 and 10000 players.

关键词： Blockchain Smart contracts Security Mathematical model Privacy Information processing

来源：评论

学校读者我要写书评

暂无评论

Quantum speedup for twin support vector machine

arXiv

引用

arXiv 2019年

作者： Ye, Zekun Li, Lvzhou Situ, Haozhen Institute of Computer Science Theory School of Data and Computer Science Sun Yat-sen University Guangzhou510006 China College of Mathematics and Informatics South China Agricultural University Guangzhou510642 China Center for Quantum Computing Pengcheng Laboratory Shenzhen518055 China The Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen University Ministry of Education China

In this work, we investigate how to speed up machine learning tasks based on quantum computation. We show an important classifier in machine learning, the twin support vector machine, can be exponentially speeded up on quantum computers. Specifically, for a training set with m samples which are represented by n-dimensional vectors, the proposed quantum algorithm can learn two non-parallel hyperplanes in O(log mn) time, and then classify a new sample in O(log n) time by comparing the distances from the simple to the two hyperplanes. Note that the classical algorithm requires polynomial time both in the training and classification procedures. Copyright © 2019, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

The Novel Sensor Network Structure for Classification Processing Based on the Machine Learning Method of the ACGAN

引用

Sensors (Switzerland) 2019年第14期19卷 3145页

作者： Chen, Yuantao Tao, Jiajun Wang, Jin Chen, Xi Yang, Kai School of Computer and Communication Engineering & Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportatio Changsha University of Science and Technology Changsha410114 China School of Information Science and Engineering Fujian University of Technology Fuzhou350118 China Hunan Institute of Scientific and Technical Information Changsha410001 China Electronics & Information School Yangtze University Jingzhou434023 China Technical Quality Department Hunan ZOOMLION Heavy Industry Intelligent Technology Corporation Limited Changsha410005 China

To address the problem of unstable training and poor accuracy in image classification algorithms based on generative adversarial networks (GAN), a novel sensor network structure for classification processing using auxiliary classifier generative adversarial networks (ACGAN) is proposed in this paper. Firstly, the real/fake discrimination of sensor samples in the network has been canceled at the output layer of the discriminative network and only the posterior probability estimation of the sample tag is outputted. Secondly, by regarding the real sensor samples as supervised data and the generative sensor samples as labeled fake data, we have reconstructed the loss function of the generator and discriminator by using the real/fake attributes of sensor samples and the cross-entropy loss function of the label. Thirdly, the pooling and caching method has been introduced into the discriminator to enable more ekective extraction of the classification features. Finally, feature matching has been added to the discriminative network to ensure the diversity of the generative sensor samples. Experimental results have shown that the proposed algorithm (CP-ACGAN) achieves better classification accuracy on the MNIST dataset, CIFAR10 dataset and CIFAR100 dataset than other solutions. Moreover, when compared with the ACGAN and CNN classification algorithms, which have the same deep network structure as CP-ACGAN, the proposed method continues to achieve better classification effects and stability than other main existing sensor solutions. © Sensors (Switzerland) 2019. All Rights Reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

VUSphere: Visual Analysis of Video Utilization in Online Distance Education 13

VUSphere: Visual Analysis of Video Utilization in Online Dis...

引用

13th IEEE Conference on Visual Analytics science and Technology, VAST 2018

作者： He, Huan Zheng, Oinghua Dong, Bo Key Laboratory of Intelligent Networks and Network Security Ministry of Education Xi'An Jiaotong University China School of Electronic and Information Engineering Xi'An Jiaotong University China School of Continuing Education Xi'An Jiaotong University China National Engineering Lab for Big Data Analytics Xi'An Jiaotong University China

ISBN: (纸本)9781538668610

Online Distance Education (ODE) provides massive course videos of various specialties for students across the country to learn professional knowledge anytime and anywhere. Analyzing the utilization of these videos from user log data can help academics better understand the learning process of students, evaluate the quality of service provided by regional learning centers, and improve the quality of program curriculum in the future. However, due to the lack of comparable indicators, it is a great challenge to discover the utilization patterns of massive videos and analyze the learning process of large-scale student population from learning log data. In this paper, we introduce a visual analytics system, called VUSphere, to explore the video utilization from multiple perspectives with two proposed indicators. This system offers three coordinated views: A spherical layout overview to depict the overall utilization distribution of videos, courses, and students;a detailed statistics view with four panels to present video utilization statistics of each element from multiple perspectives;and a comparison view to examine the differences in individual elements. Based on the real dataset from our ODE school, several patterns related to video utilization and enrollment are found in the case study with our domain experts. © 2018 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal Knowledge Distillation for Efficient Estimation of Aerial Video Saliency

arXiv

引用

arXiv 2019年

作者： Li, Jia Fu, Kui Zhao, Shengwei Ge, Shiming State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing100191 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Institute of Information Engineering Chinese Academy of Sciences Beijing100095 China School of Cyber Security at University of Chinese Academy of Sciences Beijing100095 China

—The performance of video saliency estimation techniques has achieved significant advances along with the rapid development of Convolutional Neural Networks (CNNs). However, devices like cameras and drones may have limited computational capability and storage space so that the direct deployment of complex deep saliency models becomes infeasible. To address this problem, this paper proposes a dynamic saliency estimation approach for aerial videos via spatiotemporal knowledge distillation. In this approach, five components are involved, including two teachers, two students and the desired spatiotemporal model. The knowledge of spatial and temporal saliency is first separately transferred from the two complex and redundant teachers to their simple and compact students, and the input scenes are also degraded from high-resolution to low-resolution to remove the probable data redundancy so as to greatly speed up the feature extraction process. After that, the desired spatiotemporal model is further trained by distilling and encoding the spatial and temporal saliency knowledge of two students into a unified network. In this manner, the inter-model redundancy can be further removed for the effective estimation of dynamic saliency on aerial videos. Experimental results show that the proposed approach outperforms ten state-of-the-art models in estimating visual saliency on aerial videos, while its speed reaches up to 28,738 FPS on the GPU platform. Copyright © 2019, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Mobile laser scanning systems for GPS/GNSS-denied environment mapping

Mobile laser scanning systems for GPS/GNSS-denied environmen...

引用

2018 ISPRS Technical Commission I Midterm Symposium on Innovative Sensing - From Sensors to Methods and Applications

作者： Wen, Chenglu Xia, Yan Lian, Yuhan Dai, Yudi Tan, Jinbin Wang, Cheng Li, Jonathan Fujian Key Laboratory of Sensing and Computing for Smart City School of Information Science and Engineering Xiamen University Xiamen361005 China Fujian Collaborative Innovation Center for Big Data Applications in Governments Fuzhou350003 China Faculty of Environment University of Waterloo WaterlooONN2L 3G1 Canada

Indoor 3D mapping provides a useful three-dimensional structure via an indoor map for many applications. To acquire highly efficient and relatively accurate mapping for large-scale GPS/GNSS-denied scene, we present an upgraded backpacked laser scanning system and a car-mounted indoor mobile laser scanning system. The systems provide both 3D laser scanning point cloud and camera images. In this paper, a simultaneous extrinsic calibration approach for multiple multi-beam LIDAR and multiple cameras is also proposed using the Simultaneous Localization and Mapping (SLAM)-based algorithm. The proposed approach uses the SLAM-based algorithm to achieve a large calibration scene using mobile platforms, registers an acquired multi-beam LIDAR point cloud to the terrestrial LIDAR point cloud to acquire denser points for corner feature extraction, and finally achieves simultaneous calibration. With the proposed mapping and calibration algorithms, we can provide centimetre-lever coloured point cloud with relatively high efficiency and accuracy. © Authors 2018. CC BY 4.0 License.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：