User Preference Aware Hierarchical Edge-User Cooperative Caching Strategy

The emergence of various new services has posed a huge challenge to the existing network architecture.To improve the network delay and backhaul pressure,caching popular contents at the edge of network has been considered as a feasible scheme.However,how to efficiently utilize the limited caching resources to cache diverse contents has been confirmed as a tough problem in the past decade.In this paper,considering the time-varying user requests and the heterogeneous content sizes,a user preference aware hierarchical cooperative caching strategy in edge-user caching architecture is proposed.We divide the caching strategy into three phases,that is,the content placement,the content delivery and the content update.In the content placement phase,a cooperative content placement algorithm for local content popularity is designed to cache contents proactively.In the content delivery phase,a cooperative delivery algorithm is proposed to deliver the cached contents.In the content update phase,a content update algorithm is proposed according to the popularity of the contents.Finally,the proposed caching strategy is validated using the MovieLens dataset,and the results reveal that the proposed strategy improves the delay performance by at least 35.3%compared with the other three benchmark strategies.

Deep Learning Social Network Access Control Model Based on User Preferences

A deep learning access controlmodel based on user preferences is proposed to address the issue of personal privacy leakage in social networks.Firstly,socialusers andsocialdata entities are extractedfromthe social networkandused to construct homogeneous and heterogeneous graphs.Secondly,a graph neural networkmodel is designed based on user daily social behavior and daily social data to simulate the dissemination and changes of user social preferences and user personal preferences in the social network.Then,high-order neighbor nodes,hidden neighbor nodes,displayed neighbor nodes,and social data nodes are used to update user nodes to expand the depth and breadth of user preferences.Finally,a multi-layer attention network is used to classify user nodes in the homogeneous graph into two classes:allow access and deny access.The fine-grained access control problem in social networks is transformed into a node classification problem in a graph neural network.The model is validated using a dataset and compared with other methods without losing generality.The model improved accuracy by 2.18%compared to the baseline method GraphSAGE,and improved F1 score by 1.45%compared to the baseline method,verifying the effectiveness of the model.

Personalized web pages ranking algorithm based on user preferences

In order to rank searching results according to the user preferences,a new personalized web pages ranking algorithm called PWPR（personalized web page ranking）with the idea of adjusting the ranking scores of web pages in accordance with user preferences is proposed.PWPR assigns the initial weights based on user interests and creates the virtual links and hubs according to user interests.By measuring user click streams,PWPR incrementally reflects users’ favors for the personalized ranking.To improve the accuracy of ranking, PWPR also takes collaborative filtering into consideration when the query with similar is submitted by users who have similar user interests. Detailed simulation results and comparison with other algorithms prove that the proposed PWPR can adaptively provide personalized ranking and truly relevant information to user preferences.

Selection method of risk response schemes for mining project based on fuzzy preference relations

To overcome the subjectivity of experts in the process of risk response scheme selection, according to the theory of group decision making, a selection method and flow of the risk response schemes for a mining project was proposed based on fuzzy preference relation and consistency induced ordered weighted averaging (C-IOWA) operator,which can overcome the loss of information in the process of group decision making to a great degree, and improve its efficiency and quality.A numeric example was introduced to illustrate the application of the method, also validating the method as scientific and practicable.

Incorporating User’s Preferences into Scholarly Publications Recommendation

Over the years, there has been increasing growth in academic digital libraries. It has therefore become overwhelming for researchers to determine important research materials. In most existing research works that consider scholarly paper recommendation, the researcher’s preference is left out. In this paper, therefore, Frequent Pattern (FP) Growth Algorithm is employed on potential papers generated from the researcher’s preferences to create a list of ranked papers based on citation features. The purpose is to provide a recommender system that is user oriented. A walk through algorithm is implemented to generate all possible frequent patterns from the FP-tree after which an output of ordered recommended papers combining subjective and objective factors of the researchers is produced. Experimental results with a scholarly paper recommendation dataset show that the proposed method is very promising, as it outperforms recommendation baselines as measured with nDCG and MRR.

User Preference Survey on Staircase Rotation

Staircase is an important means of vertical transportation. Staircase design exerts a great influence on the aesthetics, transportation efficiency, user comfort and experience level. In this paper, a survey on the staircase rotation preference was conducted, based on the environment behavior studies. Different user frequencies of a pair of scissors stairs in the 2nd teaching building of North China University of Technology were analyzed. The psychological effect was evaluated and quantified, and the user preference on the two staircase rotations was then withdrawn. The survey found that the type of staircase with clockwise upstairs was much more preferred （78%） than the other staircase rotation anti-clock upstairs. Considering different genders, the female shows a 66% higher preference inclination of this type of staircase rotation than the male. To improve the transportation efficiency of the staircase in case of fire, the result of this paper can be very constructive for the evacuation staircase rotation choice for the high-rise buildings.

Analyzing the Factors Affecting the Users＇ Success in Web Based Education： A Data Mining Approach

Corporations focus on web based education to train their employees ever more than before. Unlike traditional learning environments, web based education applications store large amount of data. This growing availability of data stimulated the emergence of a new field called educational data mining. In this study, the classification method is implemented on a data that is obtained from a company which uses web based education to train their employees. The authors＇ aim is to find out the most critical factors that influence the users＇ success. For the classification of the data, two decision tree algorithms, Classification and Regression Tree （CART） and Quick, Unbiased and Efficient Statistical Tree （QUEST） are applied. According to the results, assurance of a certificate at the end of the training is found to be the most critical factor that influences the users＇ success. Position, number of work years and the education level of the user, are also found as important factors.

Research on Influencing Factors of Information Dissemination Based on User Preference

The rapid development of the Intemet makes the social network of information dissemination has undergone tremendous changes. Based on the introduction of social network information dissemination mode, this paper analyzes the influencing factors of information dissemination, establishes the user preference model through CP-nets tool, and combines the AHP principle to mine the user＇s preference order, and obtain the user＇s optimal preference feature Portfolio, and finally collect the user in the microblogging platform in the historical behavior data. the use of NetLogo different users of information dissemination decision to predict.

Frequent Itemset Mining of User’s Multi-Attribute under Local Differential Privacy

Frequent itemset mining is an essential problem in data mining and plays a key role in many data mining applications.However,users’personal privacy will be leaked in the mining process.In recent years,application of local differential privacy protection models to mine frequent itemsets is a relatively reliable and secure protection method.Local differential privacy means that users first perturb the original data and then send these data to the aggregator,preventing the aggregator from revealing the user’s private information.We propose a novel framework that implements frequent itemset mining under local differential privacy and is applicable to user’s multi-attribute.The main technique has bitmap encoding for converting the user’s original data into a binary string.It also includes how to choose the best perturbation algorithm for varying user attributes,and uses the frequent pattern tree(FP-tree)algorithm to mine frequent itemsets.Finally,we incorporate the threshold random response(TRR)algorithm in the framework and compare it with the existing algorithms,and demonstrate that the TRR algorithm has higher accuracy for mining frequent itemsets.

A Multi-Agent Based Model for User Interest Mining on Sina Weibo

User interest mining on Sina Weibo is the basis of personalized recommendations,advertising,marketing promotions,and other tasks.Although great progress has been made in this area,previous studies have ignored the differences among users:the varied behaviors and habits that lead to unique user data characteristics.It is unreasonable to use a single strategy to mine interests from such varied user data.Therefore,this paper proposes an adaptive model for user interest mining based on a multi-agent system whose input includes self-descriptive user data,microblogs and correlations.This method has the ability to select the appropriate strategy based on each user’s data characteristics.The experimental results show that the proposed method performs better than the baselines.

Association Rule Analysis-Based Identification of Influential Users in the Social Media

The exchange of information is an innate and natural process that assist in content dispersal.Social networking sites emerge to enrich their users by providing the facility for sharing information and social interaction.The extensive adoption of social networking sites also resulted in user content generation.There are diverse research areas explored by the researchers to investigate the influence of social media on users and confirmed that social media sites have a significant impact on markets,politics and social life.Facebook is extensively used platform to share information,thoughts and opinions through posts and comments.The identification of influential users on the social web has grown as hot research field because of vast applications in diverse areas for instance political campaigns marketing,e-commerce,commercial and,etc.Prior research studies either uses linguistic content or graph-based representation of social network for the detection of influential users.In this article,we incorporate association rule mining algorithms to identify the top influential users through frequent patterns.The association rules have been computed using the standard evaluation measures such as support,confidence,lift,and conviction.To verify the results,we also involve conventional metrics for example accuracy,precision,recall and F1-measure according to the association rules perspective.The detailed experiments are carried out using the benchmark College-Msg dataset extracted by Facebook.The obtained results validate the quality and visibility of the proposed approach.The outcome of propose model verify that the association rule mining is able to generate rules to identify the temporal influential users on Facebook who are consistent on regular basis.The preparation of rule set help to create knowledge-based systems which are efficient and widely used in recent era for decision making to solve real-world problems.

User Profile & Attitude Analysis Based on Unstructured Social Media and Online Activity

As social media and online activity continue to pervade all age groups, it serves as a crucial platform for sharing personal experiences and opinions as well as information about attitudes and preferences for certain interests or purchases. This generates a wealth of behavioral data, which, while invaluable to businesses, researchers, policymakers, and the cybersecurity sector, presents significant challenges due to its unstructured nature. Existing tools for analyzing this data often lack the capability to effectively retrieve and process it comprehensively. This paper addresses the need for an advanced analytical tool that ethically and legally collects and analyzes social media data and online activity logs, constructing detailed and structured user profiles. It reviews current solutions, highlights their limitations, and introduces a new approach, the Advanced Social Analyzer (ASAN), that bridges these gaps. The proposed solutions technical aspects, implementation, and evaluation are discussed, with results compared to existing methodologies. The paper concludes by suggesting future research directions to further enhance the utility and effectiveness of social media data analysis.

Multi-Attribute Preferences Mining Method for Group Users with the Process of Noise Reduction

Traditional researches on user preferences mining mainly explore the user’s overall preferences on the project,but ignore that the fundamental motivation of user preferences comes from their attitudes on some attributes of the project.In addition,traditional researches seldom consider the typical preferences combination of group users,which may have influence on the personalized service for group users.To solve this problem,a method with noise reduction for group user preferences mining is proposed,which focuses on mining the multi-attribute preference tendency of group users.Firstly,both the availability of data and the noise interference on preferences mining are considered in the algorithm design.In the process of generating group user preferences,a new path is used to generate preference keywords so as to reduce the noise interference.Secondly,the Gibbs sampling algorithm is used to estimate the parameters of the model.Finally,using the user comment data of several online shopping websites as experimental objects,the method is used to mine the multi-attribute preferences of different groups.The proposed method is compared with other methods from three aspects of predictive ability,preference mining ability and preference topic similarity.Experimental results show that the method is significantly better thap other existing methods.

基于User-Ontology的图书馆用户数据挖掘研究

文摘鉴于目前图书馆用户数据挖掘精度与效率不高的问题,本文提出一种基于User-Ontology(用户本体)的图书馆用户数据挖掘的研究思路,从而在语义层面上实现对用户数据的挖掘。文章首先分析了图书馆现有用户数据挖掘中存在的主要不足,其次介绍了目前国内外不同领域用户本体的研究与构建情况,最后在构建图书馆通用用户本体的基础上,提出了基于用户本体的图书馆用户数据挖掘系统的优势、总体框架与功能构成。

基于注意力循环神经网络的联合深度推荐模型

为了向用户推荐符合兴趣偏好的项目,设计一种基于注意力循环神经网络的联合深度推荐模型。将双层注意力机制设置于网络中,该模型由五个部分构成,在输入层中生成联合深度推荐模型的输入矩阵,通过序列编码层对项目评论文本语义展开正向和反向编码,获得隐藏状态输出,并将其输入双层注意力机制中,提取项目特征,利用全连接层提取用户偏好特征。在预测层中建立项目与用户的交互模型,获得项目评分,为用户推荐高评分的项目。为了提高模型精度,加权融合MSE损失函数、CE损失函数和RK损失函数建立组合损失函数,对深度联合训练模型展开训练,提高模型的推荐性能。仿真结果表明,所提方法具有良好的推荐效果,能够适应不断变化的市场需求和用户行为。

HilAnchor:Location Privacy Protection in the Presence of Users' Preferences

Location privacy receives considerable attentions in emerging location based services.Most current practices however either ignore users＇ preferences or incompletely fulfill privacy preferences.In this paper,we propose a privacy protection solution to allow users＇ preferences in the fundamental query of k nearest neighbors （kNN）.Particularly,users are permitted to choose privacy preferences by specifying minimum inferred region.Via Hilbert curve based transformation,the additional workload from users＇ preferences is alleviated.Furthermore,this transformation reduces time-expensive region queries in 2-D space to range the ones in 1-D space.Therefore,the time efficiency,as well as communication efficiency,is greatly improved due to clustering properties of Hilbert curve.Further,details of choosing anchor points are theoretically elaborated.The empirical studies demonstrate that our implementation delivers both flexibility for users＇ preferences and scalability for time and communication costs.

Mining Interesting Knowledge from Web-Log

Web-log contains a lot of information related with user activities on the Internet. How to mine user browsing interest patterns effectively is an important and challengeable research topic. On the analysis of the present algorithm’s advantages and disadvantages we propose a new concept: support-interest. Its key insight is that visitor will backtrack if they do not find the information where they expect. And the point from where they backtrack is the expected location for the page. We present User Access Matrix and the corresponding algorithm for discovering such expected locations that can handle page caching by the browser. Since the URL-URL matrix is a sparse matrix which can be represented by List of 3-tuples, we can mine user preferred sub-paths from the computation of this matrix. Accordingly, all the sub-paths are merged, and user preferred paths are formed. Experiments showed that it was accurate and scalable. It’s suitable for website based application, such as to optimize website’s topological structure or to design personalized services. Key words Web Mining - user preferred path - Web-log - support-interest - personalized services CLC number TP 391 Foundation item: Supported by the National High Technology Development (863 program of China) (2001AA113182)Biography: ZHOU Hong-fang (1976-), female.Ph. D candidate, research direction: data mining and knowledge discovery in databases.

User Behaviors Analysis in Website Identification Registration

Nowadays, an increasing number of web applications require identification registration. However, the behavior of website registration has not ever been thoroughly studied. We use the database provided by the Chinese Software Develop Net (CSDN) to provide a complete perspective on this research point. We concentrate on the following three aspects: complexity, correlation, and preference. From these analyses, we draw the following conclusions: firstly, a considerable number of users have not realized the importance of identification and are using very simple identifications that can be attacked very easily. Secondly, there is a strong complexity correlation among the three parts of identification. Thirdly, the top three passwords that users like are 123456789, 12345678 and 11111111, and the top three email providers that they prefer are NETEASE, qq and sina. Further, we provide some suggestions to improve the quality of user passwords.

Embedding Implicit User Importance for Group Recommendation

Group recommendations derive from a phenomenon in which people tend to participate in activities together regardless of whether they are online or in reality,which creates real scenarios and promotes the development of group recommendation systems.Different from traditional personalized recommendation methods,which are concerned only with the accuracy of recommendations for individuals,group recommendation is expected to balance the needs of multiple users.Building a proper model for a group of users to improve the quality of a recommended list and to achieve a better recommendation has become a large challenge for group recommendation applications.Existing studies often focus on explicit user characteristics,such as gender,occupation,and social status,to analyze the importance of users for modeling group preferences.However,it is usually difficult to obtain extra user information,especially for ad hoc groups.To this end,we design a novel entropy-based method that extracts users’implicit characteristics from users’historical ratings to obtain the weights of group members.These weights represent user importance so that we can obtain group preferences according to user weights and then model the group decision process to make a recommendation.We evaluate our method for the two metrics of recommendation relevance and overall ratings of recommended items.We compare our method to baselines,and experimental results show that our method achieves a significant improvement in group recommendation performance.