Establishing Effective Information Center User Groups

Short staffing and insufficient technical and business knowledge among staff members can hinder information centers from meeting the needs of end users. Establishing groups of selected users with special skills improves end-user computing by opening communication channels, influencing training objectives, and fostering better user morale. This article explains the types of user groups that an information center can establish and the benefits to be derived from them.     

Methods for defining user groups and user-adjusted information structures

A common problem in the design of information systems is how to structure the information in a way that is most useful to different groups of users. This paper describes some statistical methods for revealing the structure inherent in empirical data elicited from users. It is illustrated by the application of these methods to the design of some web pages giving information about the Universitat de Valencia. Three potential user groups were identified, administrative staff, teaching staff and students. The first analysis demonstrated that users within these three groups assign relatively homogeneous structures, but that the structures assigned by the three groups are not the same, and also, teaching and administrative staff were shown to be relatively similar and different from students. Second, the ideal information structures for each group were identified and validated against the original data. The methods described can be applied to any design situation where there is an existing user population that can be called on to provide data.     

Attribute selection-based recommendation framework for short-head user group: An empirical study by MovieLens and IMDB

Most of recommender systems have serious difficulties on providing relevant services to the “short-head” users who have shown intermixed preferential patterns. In this paper, we assume that such users (which are referred to as long-tail users) can play an important role of information sources for improving the performance of recommendation. Attribute reduction-based mining method has been proposed to efficiently select the long-tail user groups. More importantly, the long-tail user groups as domain experts are employed to provide more trustworthy information. To evaluate the proposed framework, we have integrated MovieLens dataset with IMDB, and empirically shown that the long-tail user groups are useful for the recommendation process.     

Modeling users on the World Wide Web based on cognitive factors,navigation behavior and clustering techniques

This paper focuses on modeling users’ cognitive styles based on a set of Web usage mining techniques on user navigation patterns and clickstream data. Main aim is to investigate whether specific clustering techniques can group users of particular cognitive style using measures obtained from psychometric tests and content navigation behavior. Three navigation metrics are proposed and utilized to find identifiable groups of users that have similar navigation patterns in relation to their cognitive style. The proposed work has been evaluated with two user studies which entail a psychometric-based survey for extracting the users’ cognitive styles, combined with a real usage scenario of users navigating in a controlled Web 2.0 environment. A total of 106 participants of age between 17 and 25 participated in the study providing interesting insights with respect to cognitive styles and navigation behavior of users. Studies like the reported one can be useful for modeling users and assist adaptive Web 2.0 environments to organize and present information and functionalities in an adaptive format to diverse user groups.     

参与式感知系统中用户累积行为信誉计算

参与式感知系统中,由于感知数据质量可能受参与者影响,提出了基于用户累积行为的信誉计算模型以帮助选择可信赖用户.针对感知环境中用户群体的广泛性及核心用户的不确定性,该模型采用OPTICS聚类算法定义用户场景并划分行为数据集,建立用户累积行为信誉计算模型,同时引入时间戳标记信息抛弃部分旧行为以更新用户信誉.实验表明,该信誉...     

基于关联关系的微博用户可信度分析方法

随着微博研究的深入,对微博用户可信度的评价成为一个研究热点。针对微博用户可信度评价的问题,提出了一种基于关联关系的用户可信度分析方法。以新浪微博为研究对象,首先从用户的资料信息、交互信息和行为信息三个方面出发,分析了用户的7个相关特征,利用层次分析法（AHP）,进而得到用户自评价可信度;然后以用户自评价作为基点,以用户关系网络作为载体,结合用户之间潜在的用户互评关系,通过改进PageRank算法,提出了用户可信度评价模型User-Rank,进而,利用关系网络中其他用户对待分析用户的可信度进行综合评价。大规模的微博真实数据的实验表明,所提方法能够取得良好的用户可信度评价效果。     

基于协同过滤的水果推荐系统设计与实现

随着大数据技术的飞速发展,从大量的信息中如何让用户发现和挖掘出有价值的信息,一直是人们研究的热点问题。推荐系统的发展起到了关键作用,主要是发现用户和商品之间的信息,一方面为用户找到有价值的信息,另一方面为用户推荐感兴趣的商品,从而实现了用户和信息生成者的共赢。基于协同过滤的水果推荐系统通过分析用户的历史行为了解用户的喜好,在为用户提供其感兴趣的信息的同时,也能够实现个性化的推荐。     

Interactive resource recommendation algorithm based on tag information

With the popularization of social media and the exponential growth of information generated by online users, the recommender system has been popular in helping users to find the desired resources from vast amounts of data. However, the cold-start problem is one of the major challenges for personalized recommendation. In this work, we utilized the tag information associated with different resources, and proposed a tag-based interactive framework to make the resource recommendation for different users. During the interaction, the most effective tag information will be selected for users to choose, and the approach considers the users’ feedback to dynamically adjusts the recommended candidates during the recommendation process. Furthermore, to effectively explore the user preference and resource characteristics, we analyzed the tag information of different resources to represent the user and resource features, considering the users’ personal operations and time factor, based on which we can identify the similar users and resource items. Probabilistic matrix factorization is employed in our work to overcome the rating sparsity, which is enhanced by embedding the similar user and resource information. The experiments on real-world datasets demonstrate that the proposed algorithm can get more accurate predictions and higher recommendation efficiency.     

Neural TV program recommendation with label and user dual attention

TV program recommendation is very important for users to find interesting TV programs and avoid confusing users with a lot of information. Currently, they are basically traditional collaborative filtering algorithms, which only recommend through the interactive data between users and programs ignoring the important value of some auxiliary information. In addition, the neural network method based on attention mechanism can well capture the relationship between program labels to obtain accurate program and user representations. In this paper, we propose a neural TV program recommendation with label and user dual attention (NPR-LUA), which can focus on auxiliary information in program and user modules. In the program encoder module, we learn the auxiliary information from program labels through neural networks and word attention to identify important program labels. In the user encoder module, we learn the user representation through the programs that the user watches and use personalized attention mechanism to distinguish the importance of programs for each user. Experiments on real data sets show that our method can effectively improve the effectiveness of TV program recommendations than other existing models.

     

基于社交圈层和注意力机制的信息热度预测

社交网络现已成为现实世界中信息传播与扩散的主要媒介,对其中的热点信息进行建模和预测有着广泛的应用场景和商业价值,比如进行信息传播挖掘、广告推荐和用户行为分析等.目前的相关研究主要利用特征和时间序列进行建模,但是并没有考虑到社交网络中用户的社交圈层对于信息传播的作用.本文提出了一种基于社交圈层和注意力机制的热度预测模型S...     

融合用户评分与显隐兴趣相似度的协同过滤推荐算法

协同过滤算法是推荐系统中使用最广泛的算法,其核心是利用某兴趣爱好相似的群体来为用户推荐感兴趣的信息。传统的协同过滤算法利用用户-项目评分矩阵计算相似度,通过相似度寻找用户的相似群体来进行推荐,但是由于其评分矩阵的稀疏性问题,对相似度的计算不够准确,这间接导致推荐系统的质量下降。为了缓解数据稀疏性对相似度计算的影响并提高推荐质量,提出了一种融合用户评分与用户显隐兴趣的相似度计算方法。该方法首先利用用户-项目评分矩阵计算用户评分相似度;然后根据用户基本属性与用户-项目评分矩阵得出项目隐性属性;之后综合项目类别属性、项目隐性属性、用户-项目评分矩阵和用户评分时间,得到用户显隐兴趣相似度;最后融合用户评分相似度和用户显隐兴趣相似度得到用户相似度,并以此相似度寻找用户的相似群体以进行推荐。在数据集Movielens上的实验结果表明,相比传统算法中仅使用单一的评分矩阵来计算相似度,提出的新相似度计算方法不仅能够更加准确地寻找到用户的相似群体,而且还能够提供更好的推荐质量。     

ITTDAF:不依赖父权限信息传递的去中心化授权框架

为了解决现有去中心化授权协议在支持传递权限时需要传递父权限信息从而容易导致权限信息泄露的问题以及单个用户信息泄露会威胁到其他用户权限的机密性的问题,本文提出了基于检索树结构和可信平台模块的去中心化授权框架ITTDAF,其核心思想是用户在授予其他用户权限时,需要将授权信息告知提供相关资源的实体,由资源实体基于授权信息生成检索树结构,得知权限的传递关系。当用户在向资源实体请求资源时只提供自己拥有的权限信息即可证明权限有效性,并不需要用户得知父权限的相关信息。避免了用户的权限信息泄露对其他用户的权限信息机密性的破坏,同时降低了权限验证所需传输的数据量并减少权限验证所需要的时间。所有信息通过可信平台模块进行签名,以保证数据的来源的唯一性并实现权限与设备的绑定,使得权限信息不会在非用户设备上得到执行。相较于比对方案,在相同条件下本文所提出的方案在描述权限所需数据量上缩小44.2%,权限验证所需时间减少51.2%,在拥有更高安全性的同时,也有着更好的可用性。     

一种新的基于用户群体关系挖掘的随机漫游社会推荐模型

传统的协同过滤推荐算法在用户评分稀疏时,存在冷启动问题等不足,而最近几年提出的基于信任度的推荐算法以及一些它们的混合算法虽然解决了冷启动问题,却忽略了用户群体特征.针对上述情况,利用社会网络分析方法对社会性网络中的用户群体关系进行挖掘,提出一种全新的社会推荐模型Cliqueswalk,同时给出了权威推荐,为用户提供权威(意见领袖)的参考意见.实验表明,新的算法能够大大缩小目标评分信息的查找范围,推荐效率明显优于已有的协同过滤推荐算法、基于信任度的推荐算法以及它们的混合算法.     

Flickr group recommendation with auxiliary information in heterogeneous information networks

Over the past few years, the appropriate utilization of user communities or image groups in social networks (i.e., Flickr or Facebook) has drawn a great deal of attention. In this paper, we are particularly interested in recommending preferred groups to users who may favor according to auxiliary information. In real world, the images captured by mobile equipments explicitly record a lot of contextual information (e.g., locations) about users generating images. Meanwhile, several words are employed to describe the particular theme of each group (e.g., “Dogs for Fun Photos” image group in Flickr), and the words may mention particular entities as well as their belonging categories (e.g., “Animal”). In fact, the group recommendation can be conducted in heterogeneous information networks, where informative cues are in general multi-typed. Motivated by the assumption that the auxiliary information (visual features of images, mobile contextual information and entity-category information of groups in this paper) in heterogeneous information networks will boost the performance of the group recommendation, this paper proposes to combine auxiliary information with implicit user feedback for group recommendation. In general, the group recommendation in this paper is formulated as a non-negative matrix factorization (NMF) method regularized with user–user similarity via visual features and heterogeneous information networks. Experiments show that our proposed approach outperforms other counterpart recommendation approaches.     

基于权邻域的代表性用户抽样算法

代表性用户抽样方法在社会网络分析领域中得到广泛的应用，如何使其抽取的子集代表网络中所有用户具有重要的研究意义。现有方法较少关注网络拓扑结构中用户潜在的大量有用信息，通过对统计分层抽样模型进行优化，提出了一种基于权邻域的代表性用户抽样算法。为了从网络拓扑结构中获得用户更多有价值的内容，该算法使用权邻域对用户代表度计算方法进行改进，同时与用户属性相结合。之后根据用户属性值将用户分成不同属性组，计算用户在每个属性组的代表度。接着通过质量函数来衡量代表性用户的代表程度。采用启发式贪心算法抽取代表性用户。在4个数据集上与6种传统抽样算法进行实验比较，结果表明基于权邻域的代表性用户抽样算法在精确率、召回率和F1-Measure评价指标上均有提升。     

Characterizing online health and wellness information consumption: A study

To seek answers to health queries, we often find ourselves on a quest to assimilate information from varied online sources. This information search and fusion from different sources elicits user preferences, which can be driven by demographics, context, and socio-economic factors. To that end, we study these factors as part of health-information seeking behavior of users on a large health and wellness-based knowledge sharing online platform. We begin by identifying the topical interests of users from different content consumption sources. Using these topical preferences, we explore information consumption and health-seeking behavior across three contextual dimensions: user-based demographic attributes, time-related features, and community-based socioeconomic factors. We then study how these context signals can be used to explain specific user health topic preferences. Our findings suggest that linking demographic features to user profiles is more effective in explaining health preferences than other features. Our work demonstrates the value of using contextual factors to characterize and understand the content consumption of users seeking health and wellness information online.     

Selecting users for participation in IT projects: Trading a representative sample for advocates and champions?

The selection of users for participation in IT projects involves trade-offs between multiple criteria, one of which is selecting a representative cross-section of users. This criterion is basic because trading it for other criteria means basing designs on information biased toward some user groups at the expense of others. Based on interviews in development and customer organizations we find that their criteria for user selection favor persons who can contribute to the progress of the IT project over persons who are representative of the full range of users. A highly valued contribution from participating users is the ability to advocate a vision for the system and champion its organizational implementation. A survey in one customer organization shows that respondents’ personal traits explain up to 31% of the variation in their experience of aspects of the usability of a recently introduced system. Thus, unless participating users are representative as to these personal traits, IT projects may, inadvertently, bring about systems that will fail to satisfy many users.     

Identification and characterisation of Facebook user profiles considering interaction aspects

ABSTRACT

The great number of social network users and the expansion of this kind of tool in the last years demand the storage of a great volume of information regarding user behaviour. In this article, we utilise interaction records from Facebook users and metrics from complex networks study, to identify different user behaviours using clustering techniques. We found three different user profiles regarding interactions performed in the social network: viewer, participant and content producer. Moreover, the groups we found were characterised by the C4.5 decision-tree algorithm. The 'viewer' mainly observes what happens in the network. The ‘participant’ interacts more often with the content, getting a higher value of closeness centrality. Therefore, users with a participant profile are responsible, for example, for the faster transmission of information in the virtual environment, a crucial function for the Facebook social network. We noted too that ‘content producer’ users had a greater quantity of publications in their pages, leading to a superior degree of input interactions than the other two profiles. Finally, we also verify that the profiles are not mutually exclusive, that is, the user of a profile can at determined moment perform the behaviour of another profile.     

基于用户信任和兴趣的概率矩阵分解推荐方法

传统协同过滤推荐算法存在数据稀疏性、冷启动、新用户等问题.随着社交网络和电子商务的迅猛发展,利用用户间的信任关系和用户兴趣提供个性化推荐成为研究的热点.本文提出一种结合用户信任和兴趣的概率矩阵分解（STUIPMF）推荐方法.该方法首先从用户评分角度挖掘用户间的隐性信任关系和潜在兴趣标签,然后利用概率矩阵分解模型对用户评分信息、用户信任关系、用户兴趣标签信息进行矩阵分解,进一步挖掘用户潜在特征,缓解数据稀疏性.在Epinions数据集上进行实验验证,结果表明,该方法能够在一定程度上提高推荐精度,缓解冷启动和新用户问题,同时具有较好的可扩展性.     

基于文本与社交信息的用户群组识别

社交媒体上的个人群体信息对于理解社交网络结构非常有用,现有研究主要基于用户之间的链接和显式社交信息识别用户的个人群体,很少考虑使用文本信息与隐含社交信息。但是隐含社交信息以及文本信息,在显式的社交信息缺乏时对于识别用户的群体是非常有帮助的。在本文中,我们提出一种隐含因子图模型有效地利用各种隐含与显式的社交与文本信息对用户的群组进行识别。其中,显式的文本与社交信息是通过用户发表的文本与个人关系生成的,同时,我们利用矩阵分解模型自动生成隐含的文本与社交信息。最后,我们利用因子图模型与置信传播算法对显式与隐含的文本与社交信息进行集成,并对用户群组识别模型进行学习与预测。实验证明我们的方法能有效地对用户群组进行识别。