Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

58results about How to "Alleviate data sparsity" patented technology

Recommending method integrating user and project rating and characteristic factors

The invention relates to a recommending method integrating user and project rating and characteristic factors, which mainly aims at solving the problems of cold starting and data sparsity in traditional collaborative filtering recommending algorithm. A selected experimental data set is classified into a training data set and a test data set; similarity based on users and user characteristics and similarity based on projects and project characteristics are respectively calculated on the training data set; the similarities based on the users and the user characteristics are combined by selecting appropriate weight; a user nearest neighboring matrix is calculated respectively according to a dynamic selection threshold value method and a K nearest neighbor (KNN) method, an optimum method is selected through the comparison, and user recommend results are calculated by utilizing a recommending formula; the similarities based on the projects and the project characteristics are combined by selecting an appropriate weight; a project nearest neighboring matrix is calculated respectively according to the dynamic selection threshold value method and the KNN method,, an optimum method is selected through the comparison, and project recommend results are calculated by utilizing a recommending formula; and the user recommend results are combined with the project recommend results by selecting an appropriate weight.
Owner:NANJING UNIV OF POSTS & TELECOMM

Cross-network behavior association method for individual application

The invention relates to a cross-network behavior association method for individual application. The method comprises the steps that firstly specific heterogeneous information of different networks is determined, topic modeling is carried out on the networks where the heterogeneous information is located respectively, and topic distribution expression of the corresponding information is obtained. Then, behavior information of users in the corresponding networks is aggregated to obtain the topic distribution expression of the users in the different networks respectively through calculation, and a set of network-associated user attribute factor vectors is learnt for the different networks through the one-to-one corresponding relation of topic distribution of the inter-network association users in the different networks. Finally, the topic distribution of the information of the different networks can be conversed mutually through the user attribute factor vectors of the different networks, and the aim of inter-network behavior information association is achieved. A topic model and user perception are introduced in, the association breaks through the limitation of semantic association, and perception is carried out under thinner granularity.
Owner:INST OF AUTOMATION CHINESE ACAD OF SCI

POI recommendation method combining travel interest and social preference

The invention discloses a POI recommendation method combining travel interest and social preference, and the method comprises the steps: learning a user travel behavior according to the historical POIdata distribution of a user in an LBSN, and predicting a POI accessed by the user in the future travel according to the current position; Constructing social contact associated interest similarity byextracting theme vectors; Constructing a heterogeneous travel information network, and establishing interest similarity of travel behaviors; Determining a similar group by integrating social interestsimilarity analysis and travel behavior similarity analysis; Generating a candidate POI set by combining the predicted POI of the future travel access of the user and the similar groups of the user,and discovering TOP-N POI that users are most likely to go to by the calculation. According to the method, the similar groups of the user are discovered by utilizing social interest and travel preferences while position prediction is considered, more proper interest point recommendation can be comprehensively provided for the user by utilizing the similar groups instead of friend users, and the problem of data sparsity in the LBSN is relieved, so that the recommendation effect can be better improved.
Owner:CHANGAN UNIV

Real-time individuation video recommending method based on text stream network

The invention relates to a real-time individuation video recommending method based on a text stream network. The method includes the steps: S1 real-time user documents are built by using current tweets published and forwarded by users on the text stream network, a hot spot event space is built for a plurality of real-time user documents, and a plurality of current hot spot events followed by the users are obtained; S2 user documents are built by using all information of the users on the text stream network, a long-term interest topic space is built for the plurality of user documents, and long-term interest distribution vectors of the users on the space are obtained; S3 the plurality of hot spot events are ranked by using the long-term interest distribution vectors of the users, and the most interested current hot spot event of the users is obtained; S4 a plurality of videos relevant to the most interested current hot spot event of the users are retrieved on a video application platform; S5 long-term interest feature vectors of the users are obtained by using information of the users on the video application platform; S6 the plurality of videos are ranked again by using the long-term interest feature vectors of the users, and top N videos are recommended to the users.
Owner:INST OF AUTOMATION CHINESE ACAD OF SCI

Cold-start recommendation method based on user preferences and trust

The invention discloses a cold-start recommendation method based on user preferences and trust. The method comprises the steps of S1, measuring comprehensive trust values between users according to social information of the users, and constructing a trust relation matrix; S2, calculating preference similarity degrees of the users according to user scoring data, and constructing a preference relation matrix; S3, utilizing a calculation method of comprehensive similarity degrees to fuse preference relations and trust relations, and using a bee colony algorithm to iteratively update weights in the comprehensive similarity degrees, carrying out multi-objective optimization to enable the weights to become optimal in a self-adaptive manner, and constructing a preference trust relation matrix; S4, selecting a most-trusted neighbour set of the target user to predict scoring values of corresponding items for the target user on the basis of the preference trust relation matrix; and S5, recommending the items with high prediction scores to the target user. According to the method, the precision of user trust measuring is improved, the user behavior preferences are more accurately constructed, and the quality of recommendation for the cold-start user is improved.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

K neighbor-based Bayesian personalized recommendation method and device

The invention discloses a K neighbor-based Bayesian personalized recommendation method. The K neighbor-based Bayesian personalized recommendation method comprises the following steps: 1) through behavior data of a user, seeking K neighbors of the user; 2) according to observed positive feedback items of the user and observed positive feedback items of a user group consisting of k neighbor users of the user, dividing an item set; 3) determining an item level preference relation of the user; 4) maximizing the probabilities of all the users on the item set to obtain an objective function, wherein item prediction of the user is realized by adopting a matrix decomposition model; parameters in the objective function are solved by adopting a stochastic gradient descent method. The invention further discloses a K neighbor-based Bayesian personalized recommendation device. Through the K neighbor-based Bayesian personalized recommendation method and the K neighbor-based Bayesian personalized recommendation device, mutual impact between the users is taken into account, and through the impact, the item set is divided, so that the number of unobserved items is reduced, and an adverse impact caused by data imbalance and data sparseness in the recommendation process is effectively relieved.
Owner:PEKING UNIV +1

Attribute reasoning and product recommendation method based on adaptive graph convolutional network

The invention discloses an attribute reasoning and product recommendation method based on an adaptive graph convolutional network. The method comprises the following steps: 1, constructing heterogeneous data: a scoring matrix of a user to a product, a user attribute matrix, a product attribute matrix, a user attribute index matrix and a product attribute index matrix; 2, performing missing value filling preprocessing on the user attribute matrix and the product attribute matrix; 3, obtaining a cooperative matrix through one-hot coding; 4, constructing a feature fusion layer according to the attribute matrix and the collaborative matrix; 5, carrying out feature propagation through a graph convolution layer; 6, constructing a prediction layer to perform attribute reasoning and product recommendation; 7, updating the node attribute matrix according to the output result of the prediction layer; and 8, repeating the steps 4-7 until the attribute reasoning and product recommendation effectsare optimal. According to the method, the high-order structure information of the graph, the internal interaction between the node attributes and the potential association between the node attributesand the link relationship can be fully mined, so that more accurate attribute reasoning and product recommendation are realized.
Owner:HEFEI UNIV OF TECH

Short text classification method based on multiple weak supervision integration

ActiveCN111444342AHandling Imbalanced Classification Problems EfficientlyImbalanced Classification Problem SolvingNatural language data processingSpecial data processing applicationsOriginal dataClassification methods
The invention discloses a short text classification method based on multiple weak supervision integration, and the method comprises the steps: obtaining an original data set and a knowledge base, andcarrying out the data preprocessing; carrying out knowledge extraction on the preprocessed data; representing the extracted knowledge as an annotation function, and using the annotation function for data annotation; carrying out label integration through a conditional independent model; training a classification model based on a full-connection neural network; evaluating and optimizing the classification model to obtain an optimal model; and performing short text classification by utilizing the optimal model. According to the short text classification method based on multiple weak supervisionintegration, explicit knowledge and implicit knowledge are completely expressed in a mode of combining keyword matching, regular expression and remote supervision clustering; by means of probability labels generated by a label integration mechanism, automatic labeling of label-free data is achieved, the problem of data sparsity of short texts is relieved, and the problem of unbalanced classification of the short texts is effectively solved.
Owner:湖南董因信息技术有限公司

Network service recommendation method based on positions and trust relationship

The invention discloses a network service recommendation method based on positions and a trust relationship. Through the method, mobile user position context information, user preferences and the trust relationship among users are fused, and personalized network service recommendation with real-time performance and interactivity is realized. According to the method, on the basis of a network service recommendation method framework based on the positions and the trust relationship, a mobile user preference similarity calculation method based on the mobile user position context information is proposed while the generality of neighbor similarity measurement is met; then a trust value calculation method is proposed in combination with basic user communication dataset information; and the mobile user preference similarity calculation method and the trust value calculation method are fused and applied to a network service recommendation process based on the mobile user positions and the trust relationship, and therefore the personalized network service recommendation method based on the mobile user positions is formed. By use of the method, the accuracy and reliability of network servicerecommendation are effectively improved, and meanwhile the problems of data sparsity and cold start possibly existing in the recommendation process are relieved.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Score prediction method based on multi-source user comments

The invention provides a score prediction method based on multi-source user comments, and belongs to the field of recommendation systems. The method includes: performing data preprocessing on the historical consumption record of the user; calculating the similarity between different users according to the user-article scoring matrix and a similarity formula, and supplementing the user comments byusing the related comments written by the similar users with the highest similarity; extracting comment features; and finally performing comment feature fusion processing. According to the invention,related comments written by similar users can be screened out based on historical consumption records of the users; according to the method, the user comments are supplemented, and the user comment supplementing document is constructed for each user, so that the problem of data sparsity of the user comments can be relieved, user portraits are enriched, the accuracy of score prediction is improved,and the satisfaction degree of the users on a recommendation system is further improved. Besides, the user comment supplementary document is composed of related comments written by similar users, andhas a certain difference from the comments written by the users themselves, so that the recommendation diversity can be improved.
Owner:UNIV OF ELECTRONIC SCI & TECH OF CHINA +1

Time-aware adaptive interest point recommendation method based on K-means clustering

The invention discloses a time-aware adaptive interest point recommendation method based on K-means clustering. The method comprises the following steps: 1, converting a sign-in data set into a three-dimensional scoring matrix; 2, counting the number of sign-in users, the number of accessed interest points and sign-in times in each time slot, and constructing a three-dimensional sign-in feature vector of each time slot; 3, performing K-means clustering on the time slots, and calculating the time similarity between the time slots in the same cluster; 4, calculating the user similarity at the current time by using the score information in other time slots in the same time cluster; step 5, improving a traditional user-based collaborative filtering method by using a time clustering result and time similarity in a cluster, so that the traditional user-based collaborative filtering method can adaptively generate interest point prediction scores according to current recommendation time; and 6, comparing the recommendation precision of the recommendation system provided by the invention with the recommendation precision of other classic recommendation systems, and evaluating the accuracy and effectiveness of the provided technology.
Owner:南京理工大学紫金学院

Text information recommendation method and device and readable medium

The invention discloses a text information recommendation method and device and a readable medium, and the method comprises the steps: obtaining user data and a corresponding text corpus, carrying out the preprocessing of the text corpus, and obtaining text data; processing the user data to obtain user attribute features, generating text features from the text data through a word attention network, generating user knowledge graph features from the user data by using a knowledge graph representation learning model, and splicing the user attribute features, the text features and the user knowledge graph features to obtain comprehensive features; and inputting the comprehensive features into a multi-layer perceptron to obtain a user preference category and a corresponding pushing quantity. According to the method, the recognition degree and expansibility of user interests are enhanced, so that the accuracy and diversity of recommendation results are improved, multi-dimensional abstract feature representation can be obtained through comprehensive features, and the problems of data sparsity, cold start and the like in traditional personalized information recommendation are solved. And the attention mechanism is applied to text recommendation, so that the accuracy is further improved.
Owner:HUAQIAO UNIVERSITY

Time-aware adaptive interest point recommendation method based on K-means clustering

The invention discloses a time-aware adaptive interest point recommendation method based on K-means clustering. The method comprises the following steps: 1, converting a sign-in data set into a three-dimensional scoring matrix; 2, counting the number of sign-in users, the number of accessed interest points and sign-in times in each time slot, and constructing a three-dimensional sign-in feature vector of each time slot; 3, performing K-means clustering on the time slots, and calculating the time similarity between the time slots in the same cluster; 4, calculating the user similarity at the current time by using the score information in other time slots in the same time cluster; step 5, improving a traditional user-based collaborative filtering method by using a time clustering result and time similarity in a cluster, so that the traditional user-based collaborative filtering method can adaptively generate interest point prediction scores according to current recommendation time; and 6, comparing the recommendation precision of the recommendation system provided by the invention with the recommendation precision of other classic recommendation systems, and evaluating the accuracy and effectiveness of the provided technology.
Owner:NANJING VOCATIONAL UNIV OF IND TECH

Multivariate information-driven approximate fusion network recommendation propagation method

PendingCN111291260AImprove single source of informationGreat robustness robustnessRelational databasesCharacter and pattern recognitionComputation complexityTheoretical computer science
The invention provides a multivariate information-driven approximate fusion network recommendation propagation method. A propagation algorithm is recommended based on an approximate fusion network, the problems of single information source and data initial stage recommendation quality of a traditional recommendation algorithm can be effectively improved, participants in a network recommendation system are divided into four entity classes and six relationships from three key steps of an approximate fusion network recommendation propagation algorithm, and a probability transfer matrix is determined according to different types of relationships among entities. According to the invention, various types of information such as recommended objects, projects, labels and attributes and relations thereof are effectively fused; the problem of data sparseness and the problem of data initial stage recommendation quality caused by a single information source are relieved, so that recommendation results are more diversified, recommendation accuracy is obviously improved, robustness and robustness are good, calculation complexity is moderate, overall implementation is easy, and the method can be rapidly popularized to network recommendation system application and is high in market practical value.
Owner:王程
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products