In the realm of contemporary artificial intelligence,machine learning enables automation,allowing systems to naturally acquire and enhance their capabilities through learning.In this cycle,Video recommendation is fini...In the realm of contemporary artificial intelligence,machine learning enables automation,allowing systems to naturally acquire and enhance their capabilities through learning.In this cycle,Video recommendation is finished by utilizing machine learning strategies.A suggestion framework is an interaction of data sifting framework,which is utilized to foresee the“rating”or“inclination”given by the different clients.The expectation depends on past evaluations,history,interest,IMDB rating,and so on.This can be carried out by utilizing collective and substance-based separating approaches which utilize the data given by the different clients,examine them,and afterward suggest the video that suits the client at that specific time.The required datasets for the video are taken from Grouplens.This recommender framework is executed by utilizing Python Programming Language.For building this video recommender framework,two calculations are utilized,for example,K-implies Clustering and KNN grouping.K-implies is one of the unaided AI calculations and the fundamental goal is to bunch comparable sort of information focuses together and discover the examples.For that K-implies searches for a steady‘k'of bunches in a dataset.A group is an assortment of information focuses collected due to specific similitudes.K-Nearest Neighbor is an administered learning calculation utilized for characterization,with the given information;KNN can group new information by examination of the‘k'number of the closest information focuses.The last qualities acquired are through bunching qualities and root mean squared mistake,by using this algorithm we can recommend videos more appropriately based on user previous records and ratings.展开更多
With the rapid development of the Internet,more and more people begin to pay attention to social tagging which is a flexible and efficient method for classification. How to retrieve tags from the huge tag library beco...With the rapid development of the Internet,more and more people begin to pay attention to social tagging which is a flexible and efficient method for classification. How to retrieve tags from the huge tag library becomes a hot topic to research. Firstly,the existing systems of social tags and its recommendation principles used in Web 2. 0 are introduced in this paper. Secondly,the existing techniques about tag recommendation are summarized,and their merits and demerits are analysed. In most techniques for tag recommendation only two dimensions "resource-user " are considered. But there are three dimensions "resource-user-tag " in recommendation system based on social tags. A new method of social tag recommendation based on content-Feature Vote Tagging ( FVT) is proposed in this paper. Finally,several kinds of evaluation methods are used to assess the return results of methods. The experiment results show that the method proposed in this paper can satisfy the expectation of the user for the recommendation results.展开更多
Although content caching and recommendation are two complementary approaches to improve the user experience,it is still challenging to provide an integrated paradigm to fully explore their potential,due to the high co...Although content caching and recommendation are two complementary approaches to improve the user experience,it is still challenging to provide an integrated paradigm to fully explore their potential,due to the high complexity and complicated tradeoff relationship.To provide an efficient management framework,the joint design of content delivery and recommendation in wireless content caching networks is studied in this paper.First,a joint transmission scheme of content objects and recommendation lists is designed with edge caching,and an optimization problem is formulated to balance the utility and cost of content caching and recommendation,which is an mixed integer nonlinear programming problem.Second,a reinforcement learning based algorithm is proposed to implement real time management of content caching,recommendation and delivery,which can approach the optimal solution without iterations during each decision epoch.Finally,the simulation results are provided to evaluate the performance of our proposed scheme,which show that it can achieve lower cost than the existing content caching and recommendation schemes.展开更多
Recommendation-aware Content Caching(RCC)at the edge enables a significant reduction of the network latency and the backhaul load,thereby invigorating ubiquitous latency-sensitive innovative services.However,the effec...Recommendation-aware Content Caching(RCC)at the edge enables a significant reduction of the network latency and the backhaul load,thereby invigorating ubiquitous latency-sensitive innovative services.However,the effectiveness of RCC strategies is highly dependent on explicit information as regards subscribers’content request patterns,the sophisticated caching placement policy,and the personalized recommendation tactics.In this article,we investigate how the potentials of Artificial Intelligence(AI)and optimization techniques can be harnessed to address those core issues and facilitate the full implementation of RCC for the upcoming intelligent 6G era.Towards this end,we first elaborate on the hierarchical RCC network architecture.Then,the devised AI and optimization empowered paradigm is introduced,whereas AI and optimization techniques are leveraged to predict the users’content preferences in real-time situations with the assistance of their historical behavior data and determine the cache pushing and recommendation decision,respectively.Through extensive case studies,we validate the effectiveness of AI-based predictors in estimating users’content preference and the superiority of optimized RCC policies over the conventional benchmarks.At last,we shed light on the opportunities and challenges in the future.展开更多
To promote information service ability of digital libraries, a browsing and searching personalized recommendation framework based on the use of ontology is described, where the advantages of ontology are exploited in ...To promote information service ability of digital libraries, a browsing and searching personalized recommendation framework based on the use of ontology is described, where the advantages of ontology are exploited in different parts of the retrieval cycle including query-based relevance measures, semantic user preference representation and automatic update, and personalized result ranking. Both the usage and information resources can be exploited to extract useful knowledge from the way users interact with a digital library. Through combination and mapping between the extracted knowledge and domain ontology, semantic content retrieval between queries and documents can be utilized. Furthermore, ontology-based conceptual vector of user preference can be applied in personalized recommendation feedback.展开更多
In big data of business service or transaction,it is impossible to provide entire information to both of services from cyber system,so some service providers made use of maliciously services to get more interests.Trus...In big data of business service or transaction,it is impossible to provide entire information to both of services from cyber system,so some service providers made use of maliciously services to get more interests.Trust management is an effective solution to deal with these malicious actions.This paper gave a trust computing model based on service-recommendation in big data.This model takes into account difference of recommendation trust between familiar node and stranger node.Thus,to ensure accuracy of recommending trust computing,paper proposed a fine-granularity similarity computing method based on the similarity of service concept domain ontology.This model is more accurate in computing trust value of cyber service nodes and prevents better cheating and attacking of malicious service nodes.Experiment results illustrated our model is effective.展开更多
Content-based filtering E-commerce recommender system was discussed fully in this paper. Users＇ unique features can be explored by means of vector space model firstly. Then based on the qualitative value of products ...Content-based filtering E-commerce recommender system was discussed fully in this paper. Users＇ unique features can be explored by means of vector space model firstly. Then based on the qualitative value of products informa tion, the recommender lists were obtained. Since the system can adapt to the users＇ feedback automatically, its performance were enhanced comprehensively. Finally the evaluation of the system and the experimental results were presented.展开更多
Online news recommendation systems aim to address the information explosion of news and make personalized recommendations for users. The key problem of personalized news recommendation is to model users' interests...Online news recommendation systems aim to address the information explosion of news and make personalized recommendations for users. The key problem of personalized news recommendation is to model users' interests and track their changes. A common way to deal with the user modeling problem is to build user profiles from observed behavior. However, the majority of existing methods make static representations of user profiles and little research has focused on effective user modeling that could dynamically capture user interests in news topics. To address this problem, in this paper, we propose UP-TreeRec, a news recommendation framework based on a user profile tree(UP-Tree), which is a novel framework combining content-based and collaborative filtering techniques. First, by exploiting a novel topic model namely UILDA, we obtain the representation vectors for news content in a topic space as the fundamental bridge to associate user interests with news topics. Next, we design a decision tree with a dynamically changeable structure to construct a user interest profile from the user's feedback. Furthermore, we present a clustering-based multidimensional similarity computation method to select the nearest neighbor of the UP-Tree efficiently. We also provide a Map-Reduce framework-based implemen-tation that enables scaling our solution to real-world news recommendation problems. We conducted several experiments compared to the state-of-the-art approaches on real-world datasets and the experimental results demonstrate that our approach significantly improves accuracy and effectiveness in news recommendation.展开更多
Automated and accurate movie genre classification is crucial for content organization,recommendation systems,and audience targeting in the film industry.Although most existing approaches focus on audiovisual features ...Automated and accurate movie genre classification is crucial for content organization,recommendation systems,and audience targeting in the film industry.Although most existing approaches focus on audiovisual features such as trailers and posters,the text-based classification remains underexplored despite its accessibility and semantic richness.This paper introduces the Genre Attention Model(GAM),a deep learning architecture that integrates transformer models with a hierarchical attention mechanism to extract and leverage contextual information from movie plots formulti-label genre classification.In order to assess its effectiveness,we assessmultiple transformer-based models,including Bidirectional Encoder Representations fromTransformers(BERT),ALite BERT(ALBERT),Distilled BERT(DistilBERT),Robustly Optimized BERT Pretraining Approach(RoBERTa),Efficiently Learning an Encoder that Classifies Token Replacements Accurately(ELECTRA),eXtreme Learning Network(XLNet)and Decodingenhanced BERT with Disentangled Attention(DeBERTa).Experimental results demonstrate the superior performance of DeBERTa-based GAM,which employs a two-tier hierarchical attention mechanism:word-level attention highlights key terms,while sentence-level attention captures critical narrative segments,ensuring a refined and interpretable representation of movie plots.Evaluated on three benchmark datasets Trailers12K,Large Movie Trailer Dataset-9(LMTD-9),and MovieLens37K.GAM achieves micro-average precision scores of 83.63%,83.32%,and 83.34%,respectively,surpassing state-of-the-artmodels.Additionally,GAMis computationally efficient,requiring just 6.10Giga Floating Point Operations Per Second(GFLOPS),making it a scalable and cost-effective solution.These results highlight the growing potential of text-based deep learning models in genre classification and GAM’s effectiveness in improving predictive accuracy while maintaining computational efficiency.With its robust performance,GAM offers a versatile and scalable framework for content recommendation,film indexing,and media analytics,providing an interpretable alternative to traditional audiovisual-based classification techniques.展开更多
文摘In the realm of contemporary artificial intelligence,machine learning enables automation,allowing systems to naturally acquire and enhance their capabilities through learning.In this cycle,Video recommendation is finished by utilizing machine learning strategies.A suggestion framework is an interaction of data sifting framework,which is utilized to foresee the“rating”or“inclination”given by the different clients.The expectation depends on past evaluations,history,interest,IMDB rating,and so on.This can be carried out by utilizing collective and substance-based separating approaches which utilize the data given by the different clients,examine them,and afterward suggest the video that suits the client at that specific time.The required datasets for the video are taken from Grouplens.This recommender framework is executed by utilizing Python Programming Language.For building this video recommender framework,two calculations are utilized,for example,K-implies Clustering and KNN grouping.K-implies is one of the unaided AI calculations and the fundamental goal is to bunch comparable sort of information focuses together and discover the examples.For that K-implies searches for a steady‘k'of bunches in a dataset.A group is an assortment of information focuses collected due to specific similitudes.K-Nearest Neighbor is an administered learning calculation utilized for characterization,with the given information;KNN can group new information by examination of the‘k'number of the closest information focuses.The last qualities acquired are through bunching qualities and root mean squared mistake,by using this algorithm we can recommend videos more appropriately based on user previous records and ratings.
基金Sponsored by the Heilongjiang Province Science Foundation for Youths(Grant No.QC2011C012)the Harbin Foundation for the Talents of Technology Innovation(Grant No.2012RFQXG095)the Fundamental Research Funds for the Central Universities(Grant No.HEUCF100605)
文摘With the rapid development of the Internet,more and more people begin to pay attention to social tagging which is a flexible and efficient method for classification. How to retrieve tags from the huge tag library becomes a hot topic to research. Firstly,the existing systems of social tags and its recommendation principles used in Web 2. 0 are introduced in this paper. Secondly,the existing techniques about tag recommendation are summarized,and their merits and demerits are analysed. In most techniques for tag recommendation only two dimensions "resource-user " are considered. But there are three dimensions "resource-user-tag " in recommendation system based on social tags. A new method of social tag recommendation based on content-Feature Vote Tagging ( FVT) is proposed in this paper. Finally,several kinds of evaluation methods are used to assess the return results of methods. The experiment results show that the method proposed in this paper can satisfy the expectation of the user for the recommendation results.
基金supported by Beijing Natural Science Foundation(Grant L182039),and National Natural Science Foundation of China(Grant 61971061).
文摘Although content caching and recommendation are two complementary approaches to improve the user experience,it is still challenging to provide an integrated paradigm to fully explore their potential,due to the high complexity and complicated tradeoff relationship.To provide an efficient management framework,the joint design of content delivery and recommendation in wireless content caching networks is studied in this paper.First,a joint transmission scheme of content objects and recommendation lists is designed with edge caching,and an optimization problem is formulated to balance the utility and cost of content caching and recommendation,which is an mixed integer nonlinear programming problem.Second,a reinforcement learning based algorithm is proposed to implement real time management of content caching,recommendation and delivery,which can approach the optimal solution without iterations during each decision epoch.Finally,the simulation results are provided to evaluate the performance of our proposed scheme,which show that it can achieve lower cost than the existing content caching and recommendation schemes.
基金This work was supported in part by the MOE ARF Tier 2 under Grant MOE2015-T2-2-104the Singapore University of Technology and Design-Zhejiang University(SUTD-ZJU)Research Collaboration under Grant SUTD-ZJU/RES/01/2016and the SUTD-ZJU Research Collaboration under Grant SUTD-ZJU/RES/05/2016.
文摘Recommendation-aware Content Caching(RCC)at the edge enables a significant reduction of the network latency and the backhaul load,thereby invigorating ubiquitous latency-sensitive innovative services.However,the effectiveness of RCC strategies is highly dependent on explicit information as regards subscribers’content request patterns,the sophisticated caching placement policy,and the personalized recommendation tactics.In this article,we investigate how the potentials of Artificial Intelligence(AI)and optimization techniques can be harnessed to address those core issues and facilitate the full implementation of RCC for the upcoming intelligent 6G era.Towards this end,we first elaborate on the hierarchical RCC network architecture.Then,the devised AI and optimization empowered paradigm is introduced,whereas AI and optimization techniques are leveraged to predict the users’content preferences in real-time situations with the assistance of their historical behavior data and determine the cache pushing and recommendation decision,respectively.Through extensive case studies,we validate the effectiveness of AI-based predictors in estimating users’content preference and the superiority of optimized RCC policies over the conventional benchmarks.At last,we shed light on the opportunities and challenges in the future.
基金The Young Teachers Scientific Research Foundation(YTSRF) of Nanjing University of Science and Technology in the Year of2005-2006.
文摘To promote information service ability of digital libraries, a browsing and searching personalized recommendation framework based on the use of ontology is described, where the advantages of ontology are exploited in different parts of the retrieval cycle including query-based relevance measures, semantic user preference representation and automatic update, and personalized result ranking. Both the usage and information resources can be exploited to extract useful knowledge from the way users interact with a digital library. Through combination and mapping between the extracted knowledge and domain ontology, semantic content retrieval between queries and documents can be utilized. Furthermore, ontology-based conceptual vector of user preference can be applied in personalized recommendation feedback.
文摘In big data of business service or transaction,it is impossible to provide entire information to both of services from cyber system,so some service providers made use of maliciously services to get more interests.Trust management is an effective solution to deal with these malicious actions.This paper gave a trust computing model based on service-recommendation in big data.This model takes into account difference of recommendation trust between familiar node and stranger node.Thus,to ensure accuracy of recommending trust computing,paper proposed a fine-granularity similarity computing method based on the similarity of service concept domain ontology.This model is more accurate in computing trust value of cyber service nodes and prevents better cheating and attacking of malicious service nodes.Experiment results illustrated our model is effective.
基金Supported bythe Hunan Teaching Reformand Re-search Project of Colleges and Universities (2003-B72) the HunanBoard of Review on Philosophic and Social Scientific Pay-off Project(0406035) the Hunan Soft Science Research Project(04ZH6005)
文摘Content-based filtering E-commerce recommender system was discussed fully in this paper. Users＇ unique features can be explored by means of vector space model firstly. Then based on the qualitative value of products informa tion, the recommender lists were obtained. Since the system can adapt to the users＇ feedback automatically, its performance were enhanced comprehensively. Finally the evaluation of the system and the experimental results were presented.
基金supported by the Beijing Natural Science Foundation (No.4192008)the General Project of Beijing Municipal Education Commission (No. KM201710005023)
文摘Online news recommendation systems aim to address the information explosion of news and make personalized recommendations for users. The key problem of personalized news recommendation is to model users' interests and track their changes. A common way to deal with the user modeling problem is to build user profiles from observed behavior. However, the majority of existing methods make static representations of user profiles and little research has focused on effective user modeling that could dynamically capture user interests in news topics. To address this problem, in this paper, we propose UP-TreeRec, a news recommendation framework based on a user profile tree(UP-Tree), which is a novel framework combining content-based and collaborative filtering techniques. First, by exploiting a novel topic model namely UILDA, we obtain the representation vectors for news content in a topic space as the fundamental bridge to associate user interests with news topics. Next, we design a decision tree with a dynamically changeable structure to construct a user interest profile from the user's feedback. Furthermore, we present a clustering-based multidimensional similarity computation method to select the nearest neighbor of the UP-Tree efficiently. We also provide a Map-Reduce framework-based implemen-tation that enables scaling our solution to real-world news recommendation problems. We conducted several experiments compared to the state-of-the-art approaches on real-world datasets and the experimental results demonstrate that our approach significantly improves accuracy and effectiveness in news recommendation.
基金would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support(QU-APC-2025).
文摘Automated and accurate movie genre classification is crucial for content organization,recommendation systems,and audience targeting in the film industry.Although most existing approaches focus on audiovisual features such as trailers and posters,the text-based classification remains underexplored despite its accessibility and semantic richness.This paper introduces the Genre Attention Model(GAM),a deep learning architecture that integrates transformer models with a hierarchical attention mechanism to extract and leverage contextual information from movie plots formulti-label genre classification.In order to assess its effectiveness,we assessmultiple transformer-based models,including Bidirectional Encoder Representations fromTransformers(BERT),ALite BERT(ALBERT),Distilled BERT(DistilBERT),Robustly Optimized BERT Pretraining Approach(RoBERTa),Efficiently Learning an Encoder that Classifies Token Replacements Accurately(ELECTRA),eXtreme Learning Network(XLNet)and Decodingenhanced BERT with Disentangled Attention(DeBERTa).Experimental results demonstrate the superior performance of DeBERTa-based GAM,which employs a two-tier hierarchical attention mechanism:word-level attention highlights key terms,while sentence-level attention captures critical narrative segments,ensuring a refined and interpretable representation of movie plots.Evaluated on three benchmark datasets Trailers12K,Large Movie Trailer Dataset-9(LMTD-9),and MovieLens37K.GAM achieves micro-average precision scores of 83.63%,83.32%,and 83.34%,respectively,surpassing state-of-the-artmodels.Additionally,GAMis computationally efficient,requiring just 6.10Giga Floating Point Operations Per Second(GFLOPS),making it a scalable and cost-effective solution.These results highlight the growing potential of text-based deep learning models in genre classification and GAM’s effectiveness in improving predictive accuracy while maintaining computational efficiency.With its robust performance,GAM offers a versatile and scalable framework for content recommendation,film indexing,and media analytics,providing an interpretable alternative to traditional audiovisual-based classification techniques.
