检索结果-南通市图书馆

第二十七届中国控制会议

作者： Zheng Yu 1,Qian Rong 2 1.College of Science,Northeast Forestry University,Harbin 150040,P.R.china 2.Department of Computer Science,Beijing Electronic Science and Technology Institute,Beijing 100070,P.R.china

Many complex networks possess the scale-free property,which makes the task of detecting communities from these networks *** application of traditional clustering algorithms on these networks has not yielded a great deal of success. In this paper we present a method of detecting community structure based on hypergraph model to address this *** hypergraph model maps the relationship in the original data into a hypergraph.A hyperedge represents a relationship among subsets of data and the weight of the hyperedge reflects the strength of this *** assign the density of a hyperedge to its *** present and illustrate the results of experiments on the Enron data *** experiments demonstrate that our approach is applicable and effective.

关键词： Scale-free hypergraph model Community structure Local density

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

New Clustering Method in High-Di mensional Space Based on hypergraph-models

引用

Journal of Beijing Institute of Technology 2006年第2期15卷 156-161页

作者：陈建斌王淑静宋瀚涛 School of Computer Science and Technology Beijing Institute of Technology China Aviation Accounting Center

To overcome the limitation of the traditional clustering algorithms which fail to produce meaningful clusters in high-dimensional, sparseness and binary value data sets, a new method based on hypergraph model is proposed. The hypergraph model maps the relationship present in the original data in high dimensional space into a hypergraph. A hyperedge represents the similarity of attrlbute-value distribution between two points. A hypergraph partitioning algorithm is used to find a partitioning of the vertices such that the corresponding data items in each partition are highly related and the weight of the hyperedges cut by the partitioning is minimized. The quality of the clustering result can be evaluated by applying the intra-cluster singularity value. Analysis and experimental results have demonstrated that this approach is applicable and effective in wide ranging scheme.

关键词： high-dimensional clustering hypergraph model data mining

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

models and Genetic Algorithms for the Optimal Riding Routes with Transfer Times Limited in Urban Public Transportation

Models and Genetic Algorithms for the Optimal Riding Routes ...

引用

第五届运筹学及其应用国际研讨会

作者： Ruichun He Yinzhen Li Zhongfu Zhang Lanzhou Jiaotong University

With the population increase and the traffic development, urban traffic systems are becoming more and more complicated and *** this paper, we proposed a 0-1 programming model and a hypergraph model for the shortest path problem with transfer times limited. And we design the improved priority-based encoding genetic algorithm for the hypergraph model. Finally, we give a numerical example.

关键词： urban transportation transfer optimal riding route hypergraph model genetic algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：