找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Community Search over Big Graphs; Xin Huang,Laks V. S. Lakshmanan,Jianliang Xu Book 2019 Springer Nature Switzerland AG 2019

[复制链接]
查看: 14332|回复: 41
发表于 2025-3-21 16:07:06 | 显示全部楼层 |阅读模式
书目名称Community Search over Big Graphs
编辑Xin Huang,Laks V. S. Lakshmanan,Jianliang Xu
视频video
丛书名称Synthesis Lectures on Data Management
图书封面Titlebook: Community Search over Big Graphs;  Xin Huang,Laks V. S. Lakshmanan,Jianliang Xu Book 2019 Springer Nature Switzerland AG 2019
描述.Communities serve as basic structural building blocks for understanding the organization of many real-world networks, including social, biological, collaboration, and communication networks. Recently, community search over graphs has attracted significantly increasing attention, from small, simple, and static graphs to big, evolving, attributed, and location-based graphs...In this book, we first review the basic concepts of networks, communities, and various kinds of dense subgraph models. We then survey the state of the art in community search techniques on various kinds of networks across different application areas. Specifically, we discuss cohesive community search, attributed community search, social circle discovery, and geo-social group search. We highlight the challenges posed by different community search problems. We present their motivations, principles, methodologies, algorithms, and applications, and provide a comprehensive comparison of the existing techniques. This book finally concludes by listing publicly available real-world datasets and useful tools for facilitating further research, and by offering further readings and future directions of research in this impo
出版日期Book 2019
版次1
doihttps://doi.org/10.1007/978-3-031-01874-9
isbn_softcover978-3-031-00746-0
isbn_ebook978-3-031-01874-9Series ISSN 2153-5418 Series E-ISSN 2153-5426
issn_series 2153-5418
copyrightSpringer Nature Switzerland AG 2019
The information of publication is updating

书目名称Community Search over Big Graphs影响因子(影响力)




书目名称Community Search over Big Graphs影响因子(影响力)学科排名




书目名称Community Search over Big Graphs网络公开度




书目名称Community Search over Big Graphs网络公开度学科排名




书目名称Community Search over Big Graphs被引频次




书目名称Community Search over Big Graphs被引频次学科排名




书目名称Community Search over Big Graphs年度引用




书目名称Community Search over Big Graphs年度引用学科排名




书目名称Community Search over Big Graphs读者反馈




书目名称Community Search over Big Graphs读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:22:20 | 显示全部楼层
发表于 2025-3-22 03:27:29 | 显示全部楼层
发表于 2025-3-22 05:52:59 | 显示全部楼层
Interlude: Intercultural Remixes,th certain relationships. Massive networks can often be understood and analyzed in terms of these communities [165]. In the literature, several different models for cohesive (dense) subgraphs and communities have been proposed, which we will discuss in Chapters 3–6. Specifically, dense subgraphs of
发表于 2025-3-22 12:15:32 | 显示全部楼层
发表于 2025-3-22 15:15:36 | 显示全部楼层
Birmingham’s Postindustrial Metalch on a simple graph aims to find densely connected communities containing all query nodes. In applications such as analysis of protein protein interaction (PPI) networks, citation graphs, and collaboration networks, nodes tend to have attributes. Most simple structural community search algorithms i
发表于 2025-3-22 17:05:56 | 显示全部楼层
Brett Lashua,Stephen Wagg,Karl Spracklenwork induced only by his or her friends is called an ego-network. Online social networks allow users to manually categorize their friends into different social circles within their ego-networks (e.g., “circles” on Google+) [117, 170]. The task of social circle discovery is to automatically identify
发表于 2025-3-22 22:37:26 | 显示全部楼层
发表于 2025-3-23 02:35:39 | 显示全部楼层
发表于 2025-3-23 06:43:15 | 显示全部楼层
Brett Lashua,Stephen Wagg,M. Selim YavuzThis chapter first lists the community search models that are not detailed in the previous chapters. We then conclude the book by discussing future directions and open problems for further research in community search over large graphs.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-29 08:42
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表