Non-iterative Label Propagation in Optimal Leading Forest
Guizhou University of Engineering Science(贵州工程应用技术学院);Chongqing University of Posts and Telecommunications(重庆邮电大学)
Ji Xu, Guoyin Wang
备注:
Claim the itelligence property by first uploading it to the preprint platform. After carefullu revision of this initial draft, we would like to submit it to a conference or journal
Graph based semi-supervised learning (GSSL) has intuitive representation and can be improved by exploiting the matrix calculation. However, it has to perform iterative optimization to achieve a preset objective, which usually leads to low efficiency. Another inconvenience lying in GSSL is that when new data come, the graph construction and the optimization have to be conducted all over again. We propose a sound assumption, arguing that: the neighboring data points are not in peer-to-peer relation, but in a partial-ordered relation induced by the local density and distance between the data; and the label of a center can be regarded as the contribution of its followers. Starting from the assumption, we develop a highly efficient non-iterative label propagation algorithm based on a novel data structure named as optimal leading forest (LaPOLeaF). The major weaknesses of the traditional GSSL are addressed by this study. We further scale LaPOLeaF to accommodate big data by utilizing block distance matrix technique, parallel computing, and Locality-Sensitive Hashing (LSH). Experiments on large datasets have shown the promising results of the proposed methods.
Department of Electronics and Computer Engineering, Institute of Engineering, Thapathali Campus, Tribhuvan University, Kathmandu, Nepal(电子与计算机工程系,工程学院,塔帕塔利校区, Tribhuvan 大学,尼泊尔加德满都);Department of Computer Science, Swastik College, Tribhuvan University, Bhaktapur, Nepal(计算机科学系,Swastik 学院, Tribhuvan 大学,尼泊尔巴赫塔普尔);School of Computer Science, Gallogly College of Engineering, University of Oklahoma, Norman, USA(计算机科学学院,Gallogly 工程学院,俄克拉荷马大学,美国诺曼)
Optimising Random Forest Machine Learning Algorithms for User VR Experience Prediction Based on Iterative Local Search-Sparrow Search Algorithm
Northeastern University(东北大学);University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);The University of Tokyo(东京大学);Georgia Institute of Technology(佐治亚理工学院);Northern Arizona University(北亚利桑那大学)
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 大学,香港,中国)
Trained Random Forests Completely Reveal your Dataset
CIRRELT;SCALE-AI Chair in Data-Driven Supply Chains(SCALE-AI数据驱动供应链讲席);Polytechnique Montréal(蒙特利尔理工学院);University of Waterloo(滑铁卢大学);Ecole nationale des ponts et chaussées(巴黎路桥学院)
Signed iterative random forests to identify enhancer-associated transcription factor binding
University of California, San Francisco(加州大学旧金山分校);Cornell University(康奈尔大学);Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室);University of California, Berkeley(加州大学伯克利分校)
Real-Time Localization and Bimodal Point Pattern Analysis of Palms Using UAV Imagery
City University of Hong Kong(香港城市大学);Hong Kong Centre for Cerebro-Cardiovascular Health Engineering(香港脑心血管健康工程中心);Xidian University(西安电子科技大学);Wake Forest University(维克森林大学);University of California, Berkeley(加州大学伯克利分校);Tulane University(杜兰大学);Lingnan University(岭南大学)
BPRS: Belief Propagation Based Iterative Recommender System
Georgia Institute of Technology(佐治亚理工学院)
在本文中,我们介绍了第一个应用程序的信念传播(BP)算法在推荐系统的设计。我们制定的推荐问题作为一个推理问题,旨在计算边际概率分布的变量,代表的收视率进行预测。然而,计算这些边际概率函数对于大规模系统在计算上是禁止的。因此,我们利用BP算法来有效地计算这些函数。然后通过概率消息传递迭代计算每个活跃用户的推荐。相对于以前的推荐算法,BPRS不需要解决所有用户的推荐问题,如果它希望更新的建议,只有一个活动。此外,BPRS以线性复杂度计算每个用户的推荐,而不需要训练周期。通过计算机模拟(使用100 K MovieLens数据集),我们验证了BPRS迭代地减少了用户预测评分的误差,直到它收敛。最后,我们确认,BPRS是最先进的方法,如基于相关性的邻域模型(CorNgbr)和奇异值分解(SVD)的评级和精度精度方面。因此,我们认为,基于BP的推荐算法是一个新的有前途的方法,它提供了一个显着的优势,可扩展性,同时提供有竞争力的准确性的推荐系统。