检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

147 篇 期刊文献
77 篇 会议
1 篇 学位论文

馆藏范围

225 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

189 篇 工学
- 173 篇 计算机科学与技术...
- 57 篇 电气工程
- 23 篇 信息与通信工程
- 15 篇 软件工程
- 13 篇 控制科学与工程
- 5 篇 仪器科学与技术
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
50 篇 理学
- 23 篇 物理学
- 17 篇 数学
- 8 篇 生物学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 3 篇 化学
30 篇 管理学
- 28 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
- 1 篇 工商管理
5 篇 医学
- 5 篇 临床医学
- 2 篇 基础医学(可授医学...
- 1 篇 特种医学
3 篇 经济学
- 3 篇 应用经济学
1 篇 农学
- 1 篇 作物学

主题

225 篇 overlapping comm...
27 篇 complex networks
21 篇 social networks
16 篇 social network
14 篇 complex network
13 篇 community detect...
11 篇 social network a...
10 篇 label propagatio...
7 篇 modularity
6 篇 multi-objective ...
5 篇 clustering
5 篇 node similarity
5 篇 detection algori...
5 篇 social networkin...
4 篇 multiobjective e...
4 篇 image edge detec...
4 篇 label propagatio...
4 篇 multi-label prop...
4 篇 seed expansion
4 篇 game theory

机构

6 篇 jilin univ coll ...
4 篇 nanjing univ sci...
3 篇 harbin inst tech...
3 篇 northwest normal...
3 篇 china univ min &...
3 篇 jilin univ minis...
3 篇 beijing univ pos...
3 篇 harbin engn univ...
3 篇 changchun univ t...
3 篇 lanzhou univ sch...
2 篇 amirkabir univ t...
2 篇 china univ min &...
2 篇 pingdingshan uni...
2 篇 iran univ sci & ...
2 篇 chongqing univ t...
2 篇 anhui univ minis...
2 篇 vit univ sch inf...
2 篇 northwestern pol...
2 篇 xidian univ sch ...
2 篇 jamia millia isl...

作者

6 篇 wang guishen
4 篇 zhang lei
4 篇 gao yang
4 篇 huang lan
4 篇 kalantari hamed
4 篇 zhang hongli
3 篇 bu zhan
3 篇 raddaoui badran
3 篇 wang yan
3 篇 badiee aghdas
3 篇 zhou xu
3 篇 jabbour said
3 篇 zhang xingyi
3 篇 jiao licheng
3 篇 wang bin
3 篇 zhang jianpei
3 篇 liu zhihua
3 篇 ding xiaoyu
3 篇 zhang yue
3 篇 zhou yu

语言

211 篇 英文
14 篇 其他
1 篇 中文

检索条件"主题词=Overlapping Community Detection"

共 225 条记录，以下是71-80 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

OCDIB: An Information Bottleneck-Guided Approach for overlapping community detection

OCDIB: An Information Bottleneck-Guided Approach for Overlap...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Lu, Moli Luo, Linhao Zhang, Xiaofeng Harbin Inst Technol Dept Comp Sci Shenzhen Peoples R China Monash Univ Dept Comp Sci Melbourne Vic Australia

ISBN: (纸本)9798350359329;9798350359312

community detection, aiming to group nodes in a graph with strong inner-connection, has attracted increasing research attention. However, existing methods for community detection assume the communities are non-overlapping, which are rare in real-world scenarios. For the overlapping community detection (OCD) task, each community might share overlapping nodes, and thus is difficult to train discriminative node representations to simultaneously distinguish different communities. To address this issue, we propose a novel approach for overlapping community detection under the guidance of Information Bottleneck (OCDIB). Specifically, we separately model the distribution of communities at different latent spaces, from which we can sample the community-specific representation. In this way, we can better characterize the feature of each community. Then, to obtain salient representations, we propose a community-oriented information bottleneck. It aims to reduce noise in representations, while preserving the key information to express the target community. Last, we present a modularity-based loss function to guide the OCDIB to focus on the community-related structure and obtain high-quality community detection results. We have performed comprehensive experiments on both synthetic and real-world datasets, and the promising experimental results further demonstrate the effectiveness of our proposed approach w.r.t. a number of evaluation criteria.

关键词： overlapping community detection Information Bottleneck Graph Neural Network

来源：评论

学校读者我要写书评

暂无评论

An overlapping community detection Algorithm Based on Levy Flight 6

An Overlapping Community Detection Algorithm Based on Levy F...

引用

6th International Conference on Computer Science and Network Technology (ICCSNT)

作者： Sun, Qijuan Deng, Guoliang Chun, Hao Nian, Qing Li, Longjie Ma, Zhixin Lanzhou Univ Sch Informat Sci & Engn Lanzhou 730000 Peoples R China Lanzhou Municipal Publ Secur Bur Lanzhou Peoples R China

ISBN: (纸本)9781538604939

Considering the phenomenon that most intelligent optimization algorithms easily plunge into local optimum when solving the complex problem of overlapping community detection, LFOCDA, an overlapping community detection algorithm based on Levy flight, is proposed in this paper. An extended modularity function has been used as the quality measurement standard of overlapping community division. During the iterative renewed process, Levy flight has been introduced owing to the variable-step random walk characteristic, so that the algorithm has a chance to jump out of local optimum, thus expanding the search range and guiding the search closer to global optimal solution. Enormous experimental results have verified the effectiveness and adaptability of the algorithm.

关键词： modularity Levy flight intelligent optimization overlapping community detection

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony Random Walk Algorithm for overlapping community detection 1

引用

18th International Conference on Intelligent Data Engineering and Automated Learning (IDEAL)

作者： Ma, TianRen Xia, Zhengyou Yang, Fan Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Nanjing 210015 Jiangsu Peoples R China

ISBN: (数字)9783319689357

ISBN: (纸本)9783319689357;9783319689340

Discovery of communities is a very effective way to understand the properties of complex networks. An improved ant colony algorithm based on random walk has been proposed in this paper. Inspired by the framework proposed in AntCBO, firstly, a list of node importance is obtained through calculation. The nodes in the network will be sorted in descending order of importance. Secondly, on the basis of random walk, a matrix is constructed to measure the similarity of nodes and we can use this matrix and pheromone to get the heuristic information. Thirdly, an improved ant's location discovery strategy is proposed. After the movement of ants, every node will keep a list of labels and the proposed post processing will give the result of overlapping community detection. Finally, a test in real-world networks is given. The result shows that this algorithm has better performance than existing methods in finding overlapping community structure.

关键词： overlapping community detection Ant colony Random walk

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for overlapping community detection in Complex Network 12

An Algorithm for Overlapping Community Detection in Complex ...

引用

12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Wu, Yongliang He, Li Yan, Guanghui Guo, Fanglin Zheng, Weitao Khan, Abdul Basit Lanzhou Jiaotong Univ Sch Elect Informat Engn Lanzhou Peoples R China Bank Lanzhou CO LTD Lanzhou Peoples R China

ISBN: (纸本)9781467376822

In complex network, overlapping community structure is a more actual description of the structure of social networks. So, it is significant to analyze its overlapping community structure. After integrating the existing overlapping community detection algorithms and information theory, we summarize a definition of community from the perspective of information theory, then we present an algorithm to detect the overlapping community structure in complex networks after having learnt from the information dissemination theory. Experimental results illustrate that compared with the traditional definition of community and detection algorithms, the community that is detected by our algorithm have a more accurate physical meaning, meanwhile, this algorithm has a lower time complexity too.

关键词： overlapping community detection definition of community information theory information dissemination

来源：评论

学校读者我要写书评

暂无评论

A Novel overlapping community detection Using Parallel CFM and Sequential Nash Equilibrium 10

A Novel Overlapping Community Detection Using Parallel CFM a...

引用

10th International Conference on Communication Systems and Networks (COMSNETS)

作者： Sarswat, Aparna Guddeti, Ram Mohana Reddy Natl Inst Technol Karnataka Dept Informat Technol Mangalore India

ISBN: (纸本)9781538611821

Detecting overlapping community in Social Networks is one of the challenging and complex problem. Several approaches based on heuristic, modularity & modularity density, graph partitioning and game theory are available for community detection. However getting an optimum and stable solution with less computation cost for large datasets is not possible using these existing approaches. Hence, in this work, we propose a novel overlapping community detection algorithm based on parallel community forest model and sequential Nash Equilibrium for large datasets. In this paper, community forest model (CFM) is implemented in parallel using Spark framework to get the initial community structure and then a Nash Equilibrium is computed to find a stable overlapping community structure. We conducted experiments on the benchmark LFR dataset with different sizes like 500, 1000, 2000 upto 10,000 nodes to evaluate the proposed method. Our experimental results clearly demonstrate that the proposed approach outperforms the existing works in terms of quality, scalability, stability and less computation time.

关键词： overlapping community detection Nash Equilibrium Spark Framework Parallel community Forest Model Backbone degree Large-scale network

来源：评论

学校读者我要写书评

暂无评论

Instability of clustering metrics in overlapping community detection algorithms 47

Instability of clustering metrics in overlapping community d...

引用

47th Latin American Computing Conference (CLEI)

作者： Kiedanski, Diego Rodriguez-Bocca, Pablo Univ Republica Inst Comp Montevideo Uruguay

ISBN: (纸本)9781665495035

In this paper, we study the impact of data complexity and data quality in the overlapping community detection problem. We show that community detection algorithms are very unstable against incomplete or erroneous data, and this result is consistent with all the evaluated performance metrics. We verify it using three quality metrics (F1, NMI, and Omega) when the ground-truth community structure is known, in four very popular and representative detection algorithms: Order Statistics Local Optimization Method (OSLOM), Greedy Clique Expansion (GCE) algorithm, Speaker-listener Label Propagation Algorithm (SLPA), and Cluster Affiliation Model for Big Networks (BIG-CLAM). We evaluate it over a set of real instances that arise from detecting the courses that belong to different careers (degrees) of an engineering University, and over large sets of synthetic instances frequently used in the literature.

关键词： Network analysis overlapping community detection community-graph

来源：评论

学校读者我要写书评

暂无评论

Extending CDFR for overlapping community detection 1

Extending CDFR for Overlapping Community Detection

引用

1st International Conference on Data Intelligence and Security (ICDIS)

作者： Lu, Nannan Luo, Wenjian Ni, Li Jiang, Hao Ding, Weiping Univ Sci & Technol China Anhui Prov Key Lab Software Engn Comp & Commun Sch Comp Sci & Technol Hefei 230027 Anhui Peoples R China Univ Technol Sydney Ctr Artificial Intelligence Fac Engn & Informat Technol POB 123 Broadway NSW 2007 Australia

ISBN: (纸本)9781538657621

In many real-world networks, a node often belongs to multiple communities. Therefore, overlapping community detection is an important task in social network analysis. CDFR is an efficient algorithm recently proposed for non-overlapping community detection. In this paper, CDFR is extended for overlapping community detection, and the extended algorithm is called as OCDFR. In OCDFR, CDFR is first called to obtain a non-overlapping community partition. Then, find the kth NGC (k=1, 2, 3,...) node for each node, and record the fuzzy relations between them. Based on the fuzzy relation between a node and its kth NGC, five decision methods are proposed to determine whether it can join the communities to which its kth NGC belongs. Experimental results on real-world networks and synthetic networks demonstrate that OCDFR is effective and highly competitive.

关键词： Social network overlapping community detection fuzzy relation

来源：评论

学校读者我要写书评

暂无评论

A non-cooperative game model for overlapping community detection in social networks 20

A non-cooperative game model for overlapping community detec...

引用

20th IEEE International Conference on Information Reuse and Integration for Data Science (IEEE IRI)

作者： Yang, Huan Bu, Zhan Wang, Yuyao Xiong, Xi Zhang, Chengcui Nanjing Univ Finance & Econ Nanjing Peoples R China Nanjing Univ Sci & Technol Nanjing Peoples R China Chengdu Univ Informat Technol Chengdu Peoples R China Univ Alabama Birmingham Birmingham AL USA

ISBN: (纸本)9781728113371

Due to its broad real-life application, overlapping community detection (in the realm of a social network) has attracted considerable interests from many researchers. However, current methods fail to reveal the full community structure and its formation process. Thus, here we present an effective and scalable overlapping community detection algorithm, which formulates the target problem as a non-cooperative game played by multiple social actors (players). Specifically, we allow each player to join multiple communities, and the strategy of each player is denoted by a community membership vector. The adopted utility function in our game integrates both the high-order proximity and the similarity between membership vectors of social actors. By properly weighting and rewiring the original social network, our approach can nicely enhance the global community structure by incorporating higher-order node proximities. Moreover, we formally prove that the proposed game resembles and matches how a potential game works (in the classical sense in game theory), indicating that the Nash equilibrium point must exist. To find such Nash equilibrium point, we use a stochastic gradient-ascent method to update the community membership vectors of players. Extensive experiments are conducted on both synthetic and real-world social networks. After comparing our method with six baseline methods, we obtain convincing results in terms of how well the methods reveal communities, as well as its scalability.

关键词： Social networks overlapping community detection Non-cooperative game Potential game Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Evolutionary Algorithm based on Ensemble of Initializations for overlapping community detection

Multi-objective Evolutionary Algorithm based on Ensemble of ...

引用

20th International Conference on Electronics, Information, and Communication (ICEIC)

作者： Yusupov, Jamshid Palakonda, Vikas Mallipeddi, Rammohan Veluvolu, Kalyana Chakravarthy Kyungpook Natl Univ Sch Elect & Elect Engn Daegu 702701 South Korea Kyungpook Natl Univ Sch Elect Engn Dept Artificial Intelligence Daegu South Korea

ISBN: (纸本)9781728191614

Recently, developing efficient multi-objective evolutionary algorithms (MOEAs) for detect communities in complex networks has received immense recognition. Employing MOEAs for community detection provide a set of Pareto-optimal solutions (PS) where each solution in PS represent different network partition. In literature, majority of existing approaches proposed for detecting community structures focus on obtaining disjoint communities (each node belongs to a unique community). However, communities in real-world networks often overlap with each other and thus it is essential to develop algorithms for overlapping community detection. Hence, in this paper, we propose a MOEA based on ensemble of initializations for overlapping community detection (OCD-enMOEA). In OCD-enMOEA, we employ an ensemble of initialization procedure, where the individuals are encoded by an indirect representation based on permutation. Then, a decoding procedure based on community fitness is employed to transform the individuals into communities. The community fitness metrics adopted for decoding is associated with a resolution parameter alpha, which allows exploration of community structures at different levels of granularity. However, the community fitness metric is very sensitive to the parameter alpha and adapting the parameter to achieve better performance is very difficult. Hence, in this paper, we employ a set of values for the parameter alpha as an ensemble and transform the individuals into communities. To validate the performance of proposed OCD-enMOEA, we have employed five real-world networks and compared with six baseline algorithms to detect overlapping communities. The experimental results demonstrate that the proposed method exhibit better performance in comparison with the baseline algorithms.

关键词： Complex network overlapping community detection ensemble initialization multiobjective evolutionary algorithm (MOEA)

来源：评论

学校读者我要写书评

暂无评论

Parallelizing and Optimizing overlapping community detection with Speaker-Listener Label Propagation Algorithm on Multi-Core Architecture 2

Parallelizing and Optimizing Overlapping Community Detection...

引用

2nd IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA)

作者： Qiao, Yuchen Wang, Haixia Wang, Dongsheng Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China Tsinghua Univ Res Inst Informat Technol Beijing Peoples R China

ISBN: (纸本)9781509044993

Scaling up algorithms or applications in data mining studies for massive datasets to improve the computing performance is becoming crucial since we've stepped into Big Data era. For community detection, which is one of the most important topics in data mining, numerous algorithms were proposed for a better exploration of the complex networks in real world and researchers keep working on improving their computing performance by parallel programming. Speaker-listener Label Propagation Algorithm (SLPA) is a sequential linear time algorithm for overlapping community detection. In this work, we proposed a new approach to parallelize and optimize SLPA. We make it more efficient through reducing the computational complexity of one of its computing kernels and providing with a better way to get memory access during parallel execution. Evaluation of abundant experiments demonstrates our implementation's better scalability on multi-core CPUs than prior work.

关键词： overlapping community detection SLPA parallel programming label propagation multi-core CPU OpenMP

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共23页 << < 4 5 6 7 8 9 10 11 12 13 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：