Learning network flow based on rough set flow graphs and ACO clustering in distributed cognitive environments
Pages 18 - 24
Abstract
This paper presents the use of a modified collective behavior strategy of ant colonies to find approximate sets in the multi-objective optimization problem. The currently used methods search for non-dominated solutions, which takes place directly on the basis of definitions in the previously generated finite set of admissible ratings, searching in the space of goals by analyzing active constraints, solving optimization tasks in terms of all subsequent individual optimization criteria and adopting optimization criteria in order to form a substitute criterion of optimization in the form of a combination of linear criteria with appropriately selected weighting factors. However, these methods are ineffective in many cases. Therefore, the authors of the article propose a new approach based on the use of rough sets flow graphs to control the strategy of communicating artificial ants in distributed cognitive environments. The use of this approach allows to maximize the number of generated solutions and finding non-dominated solutions for the multiple objectives.
References
[1]
E. Bonabeau., M. Dorigo. and G. Theraulaz, 1999. Swarm Intelligence: From Natural to Artificial Systems, Oxford Univ. Press.
[2]
T.H. Cormen, Ch E. Leiserson, R.L. Rivest and C. Stein, 2004. Introduction to Algorithms. The MIT Press, 2<sup>nd</sup> ed.
[3]
E. Eberbach, 2005. $-Calculus of Bounded Rational Agents: Flexible Optimization as Search under Bounded Resources in Interactive Systems, Fundamenta Informaticae, vol.69, no.1--2, pp.47--102.
[4]
E. Eberbach, 2007. The $-Calculus Process Algebra for Problem Solving: A Paradigmatic Shift in Handling Hard Computational Problems, Theoretical Computer Science, vol.383, no.2--3, pp.200--243 ( ).
[5]
T. Erfani, S. V. Utyuzhnikov, 2011. Directed Search Domain: A Method for Even Generation of Pareto Frontier in Multiobjective Optimization, Journal of Engineering Optimization.
[6]
L.R. Ford, 1956. Network Flow Theory. RAND Corporation Technical Report P-923.
[7]
L.R. Ford and D.R. Fulkerson, 1962. Flows in Networks. Princeton University Press.
[8]
J. Handl, J. Knowles, M. Dorigo. 2006. Ant-based clustering and topographic mapping. Artificial Life 12(1), 35.
[9]
G. T. Heineman, G. Pollice, S. Selkow. 2008. Network Flow Algorithms. Algorithms in a Nutshell, Oreilly Media.
[10]
M. Kaisa. 1999. Nonlinear Multiobjective Optimization. Springer.
[11]
J. Kleinberg and E. Tardos, 2006. Algorithm Design, Pearson/Addison-Wesley.
[12]
A. Lewicki, K. Pancerz. R. Tadeusiewicz. 2013. The Use of Strategies of Normalized Correlation in the Ant-Based Clustering Algorithm. Lecture Notes in Computer Science, Springer-Verlag, Berlin.
[13]
K. Pancerz, A. Lewicki, R. Tadeusiewicz, J. Gomula. 2011. Ant Based Clustering of MMPI Data - An Experimental Study. Lecture Notes in Artificial Intelligence, Vol. 6954.
[14]
K. Pancerz, A. Lewicki, R. Tadeusiewicz, J. Warchol. 2012. Rough Set Flow Graphs and Ant Based Clustering in Classification of Distributed Periodic Biosignals. International Workshop on Concurency, Specification and Programming, Vol 2.
[15]
K. Pancerz, A. Lewicki, R. Tadeusiewicz, J. Warchol. 2013. Ant Based Clustering in Delta Episode Information Systems Based on Temporal Rough Set Flow Graphs. Fundamenta Informaticae, Vol. 128 (1--2), IOS Press, Amsterdam 11, pp.341--356.
[16]
Z. Pawlak, 1982. Rough Sets, Int. J. Computer and Information Sci. 11, pp.341--356.
[17]
Z. Pawlak, 2005. Flow Graphs and Data Mining, in: Transactions on Rough Sets III (J. Peters, A. Skowron, eds), Springer-Verlag, pp.1--36.
Recommendations
A hybrid ACO-PSO based clustering protocol in VANET
ICARCSET '15: Proceedings of the 2015 International Conference on Advanced Research in Computer Science Engineering & Technology (ICARCSET 2015)VANET means vehicular ad-hoc network. The routing protocol ant colony optimization (ACO) is a swarm intelligence which is based on the behavior of the ant, the ACO algorithm includes the cooperation and adaption and it produces an optimal solution. ACO ...
A covering-based pessimistic multigranulation rough set
ICIC'11: Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applicationsIn view of granular computing, the classical optimistic and pessimistic multigranulation rough set models are both primarily based on simple granules among multiple granular structures, namely multiple partitions of the universe in MGRS. This ...
Feature Selection Based on Ant Colony Optimization and Rough Set Theory
ISCSCT '08: Proceedings of the 2008 International Symposium on Computer Science and Computational Technology - Volume 01Ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. Rough set theory offers a viable approach for feature selection from data sets. In this paper, the basic concepts of rough set theory and ant ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
May 2018
72 pages
ISBN:9781450357401
DOI:10.1145/3195555
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
- SIGSOFT: ACM Special Interest Group on Software Engineering
- IEEE-CS: Computer Society
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 28 May 2018
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
ICSE '18
Sponsor:
- SIGSOFT
- IEEE-CS
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 52Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 17 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in