您的位置: 专家智库 > >

国家自然科学基金(61073043)

作品数:10 被引量:24H指数:1
相关作者:张健沛杨静蔡朝晖高兵薛立波更多>>
相关机构:哈尔滨工程大学大连东软信息学院大庆师范学院更多>>
发文基金:国家自然科学基金国家教育部博士点基金黑龙江省自然科学基金更多>>
相关领域:自动化与计算机技术交通运输工程社会学更多>>

文献类型

  • 8篇期刊文章
  • 1篇会议论文

领域

  • 7篇自动化与计算...
  • 1篇交通运输工程
  • 1篇社会学

主题

  • 2篇聚类
  • 2篇COMMUN...
  • 2篇NODES
  • 2篇OVERLA...
  • 1篇代表点
  • 1篇多态
  • 1篇多态性
  • 1篇多样性
  • 1篇隐私
  • 1篇隐私保护
  • 1篇优化查询
  • 1篇神经网
  • 1篇神经网络
  • 1篇数据发布
  • 1篇数据流
  • 1篇数据挖掘
  • 1篇匿名
  • 1篇暖通
  • 1篇暖通空调
  • 1篇网络

机构

  • 4篇哈尔滨工程大...
  • 1篇大连东软信息...
  • 1篇大庆师范学院
  • 1篇黑龙江省民政...

作者

  • 3篇张健沛
  • 2篇杨静
  • 1篇高兵
  • 1篇孙朋
  • 1篇蔡朝晖
  • 1篇薛立波

传媒

  • 2篇Journa...
  • 1篇电子学报
  • 1篇计算机应用研...
  • 1篇计算机科学
  • 1篇Journa...
  • 1篇黑龙江大学工...
  • 1篇国际计算机前...

年份

  • 1篇2016
  • 1篇2015
  • 1篇2014
  • 4篇2012
  • 2篇2011
10 条 记 录,以下是 1-9
排序方式:
A Novel Gyrocompass Alignment Method Under Large Azimuth Misalignment Angle被引量:1
2015年
Conventional gyrocompass alignment methods are based on relatively small azimuth misalignment angles.However,a marine strapdown inertial navigation system may face large azimuth misalignment angle caused by a failed coarse alignment algorithm.This paper provides a novel gyrocompass alignment method to solve the problem.Effects of system parameters are analyzed and the proper scenario of parameter switch based on the classic control theories is derived.Test results show that compared with the conventional methods,our method can accomplish the initial alignment quickly and accurately under large azimuth misalignment angle.
魏凤梅张健沛杨静姜述强谢松霖
一种基于代表点的分布式数据流聚类算法被引量:1
2012年
为发现分布式数据流下不同形状的聚簇,提出了一种基于代表点的聚类算法。算法首先在代表点定义的基础上,提出环点的概念以及迭代查找密度相连环点的算法,在此基础上生成远程站点的局部模型;然后在协调站点设计合并局部模型,生成全局聚簇的算法。通过真实数据集与仿真数据集的实验表明,算法使用代表点能够发现不同形状的聚簇并显著降低数据传输量,同时通过测试—更新局部模型算法避免了频繁发送数据。
高兵张健沛杨静
关键词:分布式数据流数据挖掘聚类代表点
A Transductive Support Vector Machine Algorithm Based on Spectral Clustering
As transductive inference makes full use of the distribution information of unlabeled samples, so compared wit...
Xu YuJing YangJian-pei Zhang
Community discovery method with uncertainty measure of overlapping nodes based on topological potential被引量:1
2012年
Community discovery of complex networks,esp.of social networks,has been a hotly debated topic in academic circles in recent years.Since actual networks usually contain some overlapping nodes that are difficult to assign to a certain community,overlapping community discovery is under great demand in practical applications.However,at present network community discovery is mainly done by non-overlapping community discovery methods,overlapping discovery methods are not common.In this context,an overlapping community discovery method is proposed hereby based on topological potential and specific algorithms are also provided.This method not only considers the spread of the uncertainty of community identity of the overlapping nodes in the network,but also realizes a quantified representation,i.e.,uncertainty measure,of the community identity of the overlapping nodes.The experiment results show that this method yields the results that are consistent with those by the classic methods and are more reasonable.
张健沛李泓波杨静白劲波初妍张乐君
关键词:SOCIALNETWORKNETWORKOVERLAPPINGCOMMUNITYTOPOLOGICAL
Network community identification method based on individual-centered theory
2012年
The studies show that numerous complex networks have clustering effect.It is an indispensable step to identify node clusters in network,namely community,in which nodes are closely related,and in many applications such as identification of ringleaders in anti-criminal and anti-terrorist network,efficient storage of data in Wireless Sensor Network(WSN).At present,most of community identification methods still require the specifications of the number or the scale of community by user and still can not handle overlapping nodes.In an attempt to solve these problems,a network community identification method based on utility value is proposed,which is a function of each node's clustering coefficient and degree.This method makes use of individual-centered theory for reference and can automatically determine the number of communities.In addition,this method is an overlapping community identification method in nature.It is shown through contrastive experiments that this method is more efficient than other methods based on individual-centered theory when they control the same amount of information.Finally,a research direction is proposed for network community identification method based on the individual-centered theory.
李泓波白劲波初妍张乐君
关键词:THEORYCOMMUNITYOVERLAPPINGCOMMUNITYUTILITYVALUE
一种基于多态关联挖掘的位置服务优化查询方法被引量:1
2014年
高效可靠的位置服务查询方法是位置服务广泛应用的关键。传统的位置服务查询方法采用近邻查询的方法,在对近邻的分割时往往面临稳定性差的问题,无法实现高效查询。提出一种基于多态关联挖掘的位置服务优化查询方法,该方法根据查询标准,将数据分为多个状态,然后对多个状态进行关联挖掘,提取数据的深层次特征,根据深层次特征,对位置服务的查询方法进行优化查询来提高系统查询的效率和可靠性。采用查全率和查准率作为衡量标准,对200组数据进行了实际分析,结果显示,基于多态关联挖掘的位置服务查询方法使查全率和查准率分别提高9.5%和8.8%,研究成果在位置服务和信息挖掘中具有很好的应用价值。
蔡朝晖蔡朝晖杨静
关键词:多态性优化查询
基于BP神经网络的改进增量式PID暖通控制器设计
2011年
为了克服传统PID控制在暖通空调系统应用中超调量大、控制精度低的缺陷,提出了一种基于BP神经网络的PID控制器设计方法。利用BP神经网络具有很强的学习能力、任意逼近非线性能力、自适应性和鲁棒性等特点,将BP神经网络与PID控制结合,实现了PID的3个控制参数的在线自整定。仿真结果表明,该方法可以显著改善系统的动态性能和控制精度,实现了PID控制参数的在线动态调整,避免了由于系统模型和结构参数变化导致的控制效果不稳定。
孙朋张健沛薛立波
关键词:PID暖通空调BP神经网络
Measurement of Nodes Importance for Complex Networks Structural-Holes-Oriented
2016年
Mining important nodes in the complex network should not only consider the core nodes, but also consider the locations of the nodes in the network. Despite many researches on discovering important nodes, the importance of nodes in the structural holes is still ignored easily. Therefore, this paper proposes a method of local centrality measurement based on structural holes, which evaluates the nodes importance both by direct and indirect constraints caused by the lack of structural holes around the nodes. In this method, the attributes and locations of the nodes and their first-order and second-order neighbors are taken into account simultaneously. Deliberate attack simulation is carried out through selective deletion in a certain proportion of network nodes. Calculating the decreased ratio of network efficiency is to quantitatively describe the importance of nodes in before-and-after attacks. Experiments indicate that this method has more advantages to mine important nodes compared to clustering coefficient and k-shell decomposition method. And it is suitable for the quantitative analysis of the nodes importance in large scale networks.
Hui XuJianpei ZhangJing YangLijun Lun
关键词:STRUCTURALHOLESNODESIMPORTANCE
聚类的(α,k)-匿名数据发布被引量:19
2011年
为更好的抵御背景知识攻击和同质攻击,保护特定的敏感值或全部敏感值,定义了单敏感值(,αk)-匿名模型和多敏感值(,αk)-匿名模型,并分别设计了两个聚类算法予以实现,同时分析了算法的正确性和复杂性.对于即包含连续属性又包含分类属性的数据集,给出了数据集的详细映射与处理方法,使数据集中点的距离可以方便的计算,彻底避免了把数据点距离和信息损失混淆的情况.详细的理论分析和大量的实验评估表明算法有较小的信息损失和较快的执行时间.
杨高明杨静张健沛
关键词:数据发布K-匿名隐私保护聚类
共1页<1>
聚类工具0