检索结果-南通市图书馆

A Robust Collaborative Recommendation Algorithm Based on k-distance and Tukey M-estimator

China Communications 2014年第9期11卷 112-123页

作者： YI Huawei ZHANG Fuzhi LAN Jie School of Information Science and Engineering Yanshan University Qinhuangdao 066004 Hebei Province E R.China The key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 P. R. China Liaoning University of Technology Jinzhou 121001 Liaoning Province P. R. China

The existing collaborative recommendation algorithms have lower robustness against shilling *** this problem in mind,in this paper we propose a robust collaborative recommendation algorithm based on k-distance and Tukey ***,we propose a k-distancebased method to compute user suspicion degree(USD).The reliable neighbor model can be constructed through incorporating the user suspicion degree into user neighbor *** influence of attack profiles on the recommendation results is reduced through adjusting similarities among ***,Tukey M-estimator is introduced to construct robust matrix factorization model,which can realize the robust estimation of user feature matrix and item feature matrix and reduce the influence of attack profiles on item feature ***,a robust collaborative recommendation algorithm is devised by combining the reliable neighbor model and robust matrix factorization *** results show that the proposed algorithm outperforms the existing methods in terms of both recommendation accuracy and robustness.

关键词： shilling attacks robust collaborative recommendation matrix factori-zation k-distance Tukey M-estimator

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The k-Diameter of a kind of Circulant Graph

引用

Journal of Electronic Science and Technology of China 2004年第4期2卷 72-75页

作者：张先迪 School of Applied Mathematics UESTC Chengdu 610054 China

The diameter of a graph G is the maximal distance between pairs of vertices of G. When a network is modeled as a graph,diameter is a measurement for maximum transmission delay. The k-diameter dk(G) of a graph G, which deals with k internally disjoint paths between pairs of vertices of G, is a extension of the diameter of G. It has widely studied in graph theory and computer science. The circulant graph is a group-theoretic model of a class of symmetric interconnection network. Let Cn(i, n / 2) be a circulant graph of order n whose spanning elements are i and n / 2, where n≥4 and n is even. In this paper, the diameter, 2-diameter and 3-diameter of the Cn(i, n / 2) are all obtained if gcd(n,i)=1, where the symbol gcd(n,i) denotes the maximum common divisor of n and i.

关键词： distance diameter k-distance k-diameter circulant graph

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

k-Diameter of Circulant Graph with Degree 3

引用

Journal of Electronic Science and Technology of China 2005年第3期3卷 280-283页

作者：张先迪李曼荔 School of Applied Mathematics University of Electronic Science and Technology of China Chengdu 610054 China

Parameters k-distance and k-diameter are extension of the distance and the diameter in graph theory. In this paper, the k-distance dk （x,y） between the any vertices x and y is first obtained in a connected circulant graph G with order n （n is even） and degree 3 by removing some vertices from the neighbour set of the x. Then, the k-diameters of the connected circulant graphs with order n and degree 3 are given by using the k-diameter dk （x,y）.

关键词： distance diameter k-distance k-diameter circulant graph

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：