Search

From the perspective of practical application, information popularity prediction is of positive significance for corporate marketing, advertising, traffic control, and risk management. This paper combines the fast K-nearest neighbor algorithm to predict and analyze the popularity of multimedia network information and improves the nonindependent and identically distributed KNN classification algorithm. Moreover, this paper proves that it is a superior measurement method when considering the nonindependent and identical distribution among data objects to measure similarity and the improved CS_KNN algorithm can greatly improve the classification performance. Finally, this paper constructs a prediction model of multimedia network information popularity based on the fast K neighbor algorithm. Through the experimental research results, it can be seen that the prediction effect of the multimedia network information popularity prediction system based on the fast K neighbor algorithm proposed in this study is very good. [ABSTRACT FROM AUTHOR]

The recognition of hand movements is an important method for human-computer interaction (HCI) technology, and it is widely used in virtual reality and other HCI areas. While many valuable efforts have been made, efficient ways to capture over 20 types of hand movements with high accuracy by one data glove are still lacking. This paper addresses a new classification framework for 52 hand movements. This classification framework includes the following two parts: the movement detection algorithm and the movement classification algorithm. The fine K-nearest neighbor (Fine KNN) is the core of the movement detection algorithm. The movement classification algorithm is composed of downsampling in data preparation and a new deep learning network named the DBDF network. Bidirectional Long Short-Term Memory (BiLSTM) is the main part of the DBDF network. The results of experiments using the Ninapro DB1 dataset demonstrate that our work can classify more types of hand movements than related algorithms with a precision of 93.15%. [ABSTRACT FROM AUTHOR]