Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Network Analysis in Natural Sciences and Engineering
Article type: Research Article
Authors: Puzis, Rami; | Elovici, Yuval | Dolev, Shlomi
Affiliations: Deutsche Telekom Laboratories at Ben-Gurion University of the Negev, Israel | Deutsche Telekom Laboratories at Ben-Gurion University of the Negev, Israel. E-mail: elovici@inter.net.il; Tel.: 972 8 647 7551 | Department of Computer Science Ben-Gurion University of the Negev, Israel. E-mail: dolev@cs.bgu.ac.il; Tel.: 972 8 647 2715
Note: [] Corresponding author: Rami Puzis, Deutsche Telekom Laboratories at Ben-Gurion University of the Negev, Israel. E-mail: puzis@bgu.ac.il
Abstract: In many applications we are required to locate the most prominent group of vertices in a complex network. Group Betweenness Centrality can be used to evaluate the prominence of a group of vertices. Evaluating the Betweenness of every possible group in order to find the most prominent is not computationally feasible for large networks. In this paper we present two algorithms for finding the most prominent group. The first algorithm is based on heuristic search and the second is based on iterative greedy choice of vertices. The algorithms were evaluated on random and scale-free networks. Empirical evaluation suggests that the greedy algorithm results were negligibly below the optimal result. In addition, both algorithms performed better on scale-free networks: heuristic search was faster and the greedy algorithm produced more accurate results. The greedy algorithm was applied for optimizing deployment of intrusion detection devices on network service provider infrastructure.
Keywords: Complex networks, group betweenness centrality, heuristic search
Journal: AI Communications, vol. 20, no. 4, pp. 287-296, 2007
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl