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

Detecting community structure in bipartite networks based on matrix factorisation

International Journal of Wireless and Mobile Computing 2013年第6期6卷 599-607页

作者： Chen, Bo-Lun Chen, Ling Zou, Sheng-Rong Xu, Xiu-Lian Department of Computer Science Nanjing University of Aeronautics and Astronautics Nanjing 210016 China Department of Computer Science Yangzhou University Yangzhou 225009 China State Key Lab. of Novel Software Technology Nanjing University Nanjing 210093 China College of Physics Science and Technology Yangzhou University Yangzhou 225009 China

Community detection in bipartite network is very important in the research on the theory and applications of complex network analysis. In this paper, an algorithm for detecting community structure in bipartite networks based on matrix factorisation is presented. The algorithm first partitions the network into two parts, each of which can reserve the community information as much as possible, and then the two parts are further recursively partitioned until the modularity cannot be further improved. While partitioning the network, we use the approach of matrix decomposition so that the row space of the associated matrix of the networks can be approximated as close as possible and the community information can be reserved as much as possible. Experimental results show that our algorithm can not only accurately identify the number of communities of a network, but also obtain higher quality of community partitioning without previously known parameters. Copyright © 2013 Inderscience Enterprises Ltd.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

Clustering algorithm based on Delaunay triangulation density metric

Clustering algorithm based on Delaunay triangulation density...

引用

International Conference on Fuzzy systems and Knowledge Discovery (FSKD)

作者： Jia, L.V. Chongqing Key Lab. of Operations Research and System Engineering College of Computer and Information Science Chongqing Normal University Chongqing 400047 China

ISBN: (纸本)9781424459346

According to the problem that K-Means clustering algorithm fails to correctly distinguish non-convex shape clusters, computation mode of distance in the algorithm is changed and density metric mode which can reflect the characteristics of data themselves is adopted instead. In the mode, Delaunay triangulation graph which has the advantages of nearest neighbour and adjacency is introduced to compute density. Simultaneously, because K-Means clustering algorithm itself belongs to a global optimization problem, chaos optimization dedicated to global optimization is applied to optimize objective function for the sake of obtaining global minimum solution. Experiments results indicate that clustering algorithm based on Delaunay triangulation density metric can find arbitrary non-convex shape clusters. ©2010 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Cuckoo: Towards decentralized, socio-aware online microblogging services and data measurements

Cuckoo: Towards decentralized, socio-aware online microblogg...

引用

2nd ACM International Workshop on Hot Topics in Planet-scale Measurement, HotPlanet '10

作者： Xu, Tianyin Chen, Yang Zhao, Jin Fu, Xiaoming Institute of Computer Science University of Goettingen Goettingen Germany State Key Lab. for Novel Software and Technology Nanjing University Nanjing China School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9781450301770

Online microblogging services, as exemplified by Twitter [9] and Yammer [12], have become immensely popular during the latest three years. Twitter, the most successful mi-croblogging service, has attracted more than 41.7 million users as of July 2009 [25] and is still growing fast. However, current microblogging systems severely suffer from performance bottlenecks and central points of failure due to their centralized architecture. Thus, centralized microblogging systems may threaten the scalab.lity, reliability, as well as availab.lity of the offered services, not to mention the extremely high operational and maintenance cost. However, it is not trivial to decentralize microblogging services in a peer-to-peer fashion. The challenges first derive from the heterogeneity of the inherent online social network (OSN) features. The non-reciprocation feature of microblog-ging services also increases the heterogeneity. Moreover, different from traditional approaches used in centralized server-based systems, an efficient, robust and scalab.e approach for data collection and dissemination in such distributed heterogeneous environments is desirable. In this paper, we present a decentralized, socio-aware mi-croblogging system named Cuckoo. The design takes advantages of the inherent social relationships while leverages P2P techniques towards scalab.e, reliable microblogging services. Besides, Cuckoo provides a flexible interface for data collection while circumventing unnecessary traffic on the server. We discuss the benefits that our system may bring for both service providers and end users. We also discuss the technical aspects to be considered and report our work in progress. © 2010 ACM.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

User demand description and optimization in web data management

User demand description and optimization in web data managem...

引用

8th Web Information systems and Applications Conference, WISA 2011, Workshop on Semantic Web and Ontology, SWON 2011, Workshop on Electronic Government Technology and Application, EGTA 2011

作者： Wang, Hui Ou, Weijie Peng, Zhiyong Zhai, Weixiang Chen, Ran State Key Lab. of Software Engineering Wuhan University of China Wuhan China Computer School Wuhan University of China Wuhan China

ISBN: (纸本)9780769545554

Based on object deputy database, newly proposed web data management system (WDMS) provides user with personal data spaces to flexibly manage their various web data. Limited to database capacity, WDMS should gather data that user need from Web according to user demand implied in their personal data spaces. However, user demand that expressed in SQL sentences in data spaces can't be comprehended and executed by meta-search engine. Confronted with the problem, this paper proposed a user demand description method which is helpful to formalize user demand expression and bridge the gap between user demand and web data sources. Based on user demand description, this paper also proposed user demand set optimization method to eliminate the subset and intersection relationship among user demand set. The experimental results demonstrate that user demand description and its optimization method can well express complex user demand and reduce redundant query cost. This work can be widely used in various kinds of personal Web data service system. © 2011 IEEE.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Geo-WDBMS: An improved DBMS with the function of watermarking geographical data

引用

12th International Conference on Database systems for Advanced Applications, DASFAA 2007

作者： Min, Huang Xiang, Zhou Jiaheng, Cao Zhiyong, Peng Computer School Wuhan University Wuhan 430072 China State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China

ISBN: (纸本)9783540717027

This paper focuses on the issue of geographical data's copyrights protection. A Geo-WDBMS has been built by embedding the watermarking functions into the inner code of the open source DBMS PostgreSQL. And its core watermarking mechanism is to insert and detect mark bits in the coordinates of the vertices in geographical objects using the methods of classifying and twice majority-voting. Further more, error correcting mechanism is used to enhance the resilience of the system and blind watermark is realized. Experiments on watermarking digital maps showed that the marked maps are inconspicuous and robust to various attacks. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

A local greedy search method for detecting community structure in weighted social networks

A local greedy search method for detecting community structu...

引用

9th International Conference on Advanced Data Mining and Applications, ADMA 2013

作者： Liu, Bin Qian, Tieyun Computer School Wuhan University Wuhan 430071 China State Key Lab. of Software Engineering Wuhan University Wuhan 430071 China

ISBN: (纸本)9783642539138

In this paper, we give a new definition of community which is composed of two parts: community core and the periphery. Community core consists of highly densely connected nodes. And we propose LGSM (Local Greedy Search Method) for discovering community structures in social networks. LGSM sorts node according to weighted degree. For each node, LGSM derives a maximal weighted clique as a seed cluster. Then, LGSM adds new nodes into the seed cluster until the weighted edge density is smaller than the threshold value. After all community cores are detected, LGSM allots isolated nodes to the detected cores, and optimizes the community structure based on modularity. Our method is an integrative method, which is applicable not only to discovering overlapping communities, but also to discovering non-overlapping community. Experiments illustrate that LGSM can achieve good community structure on synthetic and real-world networks and the time complexity is O(|E|Ig(|V|)). © Springer-Verlag 2013.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

A three layer system architecture for web-based unstructured data management

A three layer system architecture for web-based unstructured...

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Peng, Zhiyong Wang, Hui Peng, Yuwei Xu, Bo Huang, Zeqian Computer School Wuhan University Wuhan Hubei 430072 China State Key Lab. of Software Engineering Wuhan Hubei 430072 China

ISBN: (纸本)9780769540122

With the rapid growing of data on Web, we are facing three serious problems. Firstly, there are a huge number of data resources which are heterogeneous and dynamic. Secondly, most of data on Web are unstructured. Thirdly, there are various kinds ofWeb users who have different interests and requirements. In this paper, we proposed a new system architecture for unstructured data management on Web to solve these problems by integrating data spaces, database and meta search engine. The system architecture consists of three layers for data gathering on demand, dynamic management and personalized service, respectively. Data servicing layer allows Web users to create data spaces with advanced functions to manipulate and access Web data, eg, cross media query and automatic recommendation. Data managing layer models both Web data and their semantic relationships using our object deputy database named as TOTEM;it also supports schema evolution and dynamic classification. Data gathering layer extracts user's interest from his or her data space;gathers the related data on Web and further analyzes their semantic relationships. Finally, we implemented a prototype system Tmusic based on this new system architecture to show its availab.lity. © 2010 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of computer science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

Intrusion detection based on improved fuzzy C-means algorithm

Intrusion detection based on improved fuzzy C-means algorith...

引用

2008 International Symposium on Information science and Engineering, ISISE 2008

作者： Wei, Jiang Yao, Min Yan, Jun College of Computer Zhejiang University Wuhan 430072 China State Key Lab. for Software Engineering Wuhan University Hangzhou 310027 China

ISBN: (纸本)9780769534947

Clustering is one of the important means of Intrusion detection. In order to overcome the disadvantages of fuzzy C-means algorithm, this paper presents a kind of improved fuzzy C-means algorithm (IFCM for short). IFCM algorithm reduces the infection of isolated point by means of weighting the degree of membership for objects to be clustered, and avoids the subjectivity in choosing the number of clustering by introducing the function of validity. Then, IFCM algorithm is used to intrusion detection, and satisfactory experiment effects are obtained. © 2008 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

ShadowStory: Creative and collab.rative digital storytelling inspired by cultural heritage 11

ShadowStory: Creative and collaborative digital storytelling...

引用

Proceedings of the SIGCHI Conference on Human Factors in Computing systems

作者： Lu, Fei Tian, Feng Jiang, Yingying Cao, Xiang Luo, Wencan Li, Guang Zhang, Xiaolong Dai, Guozhong Wang, Hongan Intelligence Engineering Lab. Institute of Software Chinese Academy of Sciences Beijing China Microsoft Research Cambridge Cambridge United Kingdom Pennsylvania State University PA United States State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781450302289

With the fast economic growth and urbanization of many developing countries come concerns that their children now have fewer opportunities to express creativity and develop collab.ration skills, or to experience their local cultural heritage. We propose to address these concerns by creating technologies inspired by traditional arts, and allowing children to create and collab.rate through playing with them. ShadowStory is our first attempt in this direction, a digital storytelling system inspired by traditional Chinese shadow puppetry. We present the design and implementation of ShadowStory and a 7-day field trial in a primary school. Findings illustrated that ShadowStory promoted creativity, collab.ration, and intimacy with traditional culture among children, as well as interleaved children's digital and physical playing experience. Copyright 2011 ACM.

关键词： Developing countries

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：