80 research outputs found
FGPGA: An Efficient Genetic Approach for Producing Feasible Graph Partitions
Graph partitioning, a well studied problem of parallel computing has many
applications in diversified fields such as distributed computing, social
network analysis, data mining and many other domains. In this paper, we
introduce FGPGA, an efficient genetic approach for producing feasible graph
partitions. Our method takes into account the heterogeneity and capacity
constraints of the partitions to ensure balanced partitioning. Such approach
has various applications in mobile cloud computing that include feasible
deployment of software applications on the more resourceful infrastructure in
the cloud instead of mobile hand set. Our proposed approach is light weight and
hence suitable for use in cloud architecture. We ensure feasibility of the
partitions generated by not allowing over-sized partitions to be generated
during the initialization and search. Our proposed method tested on standard
benchmark datasets significantly outperforms the state-of-the-art methods in
terms of quality of partitions and feasibility of the solutions.Comment: Accepted in the 1st International Conference on Networking Systems
and Security 2015 (NSysS 2015
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
As cloud computing is gaining popularity, an important question is how to optimally deploy software applications on the offered infrastructure in the cloud. Especially in the context of mobile computing where software components could be offloaded from the mobile device to the cloud, it is important to optimize the deployment, by minimizing the network usage. Therefore we have designed and evaluated graph partitioning algorithms that allocate software components to machines in the cloud while minimizing the required bandwidth. Contrary to the traditional graph partitioning problem our algorithms are not restricted to balanced partitions and take into account infrastructure heterogenity. To benchmark our algorithms we evaluated their performance and found they produce 10 to 40 % smaller graph cut sizes than METIS 4.0 for typical mobile computing scenarios
Recent Advances in Graph Partitioning
We survey recent trends in practical algorithms for balanced graph
partitioning together with applications and future research directions
MULTILEVEL ANT COLONY OPTIMIZATION TO SOLVE CONSTRAINED FOREST TRANSPORTATION PLANNING PROBLEMS
In this dissertation, we focus on solving forest transportation planning related problems, including constraints that consider negative environmental impacts and multi-objective optimizations that provide forest managers and road planers alternatives for making informed decisions. Along this line of study, several multilevel techniques and mataheuristic algorithms have been developed and investigated. The forest transportation planning problem is a fixed-charge problem and known to be NP-hard. The general idea of utilizing multilevel approach is to solve the original problem of which the computational cost maybe prohibitive by using a set of increasingly smaller problems of which the computational cost is cheaper.
The multilevel techniques are devised consisting of two parts. The first part is to recursively apply a graph coarsening heuristic to the original problem to produce a set of coarser level problems of which the sizes in terms of number of problem components such as edges and nodes are in decreasing order. The second part is to solve the set of the coarser level problems including the original problem bottom up, starting with the coarsest level. We propose that if coarser level problems inherit important properties (such as attribute value distribution) from their ancestor during the coarsening process, they can be treated as smaller versions of the original problem. Based on this hypothesis, the multilevel techniques use solutions obtained for the coarser level problems to solve the finer level problems.
Mainly, we develop multilevel techniques to address three problems, namely a constrained fixed-charge problem, parameter configuration problem, and a multi-objective transportation optimization problem in this study. The performance of the multilevel techniques is compared with other commonly used approaches. The statistical analyses on the experimental results indicate that the multilevel approach can reduce computing time significantly without sacrificing the solution quality
Ant colony optimization based clustering for data partitioning.
Woo Kwan Ho.Thesis (M.Phil.)--Chinese University of Hong Kong, 2005.Includes bibliographical references (leaves 148-155).Abstracts in English and Chinese.Contents --- p.iiAbstract --- p.ivAcknowledgements --- p.viiList of Figures --- p.viiiList of Tables --- p.xChapter Chapter 1 --- Introduction --- p.1Chapter Chapter 2 --- Literature Reviews --- p.7Chapter 2.1 --- Block Clustering --- p.7Chapter 2.2 --- Clustering XML by structure --- p.10Chapter 2.2.1 --- Definition of XML schematic information --- p.10Chapter 2.2.2 --- Identification of XML schematic information --- p.12Chapter Chapter 3 --- Bi-Tour Ant Colony Optimization for diagonal clustering --- p.15Chapter 3.1 --- Motivation --- p.15Chapter 3.2 --- Framework of Bi-Tour Ant Colony Algorithm --- p.21Chapter 3.3 --- Re-order of the data matrix in BTACO clustering method --- p.27Chapter 3.3.1 --- Review of Ant Colony Optimization --- p.29Chapter 3.3.2 --- Bi-Tour Ant Colony Optimization --- p.36Chapter 3.4 --- Determination of partitioning scheme --- p.44Chapter 3.4.1 --- Weighed Sum of Error (WSE) --- p.48Chapter 3.4.2 --- Materialization of partitioning scheme via hypothetic matrix --- p.50Chapter 3.4.3 --- Search of best-fit hypothetic matrix --- p.52Chapter 3.4.4 --- Dynamic programming approach --- p.53Chapter 3.4.5 --- Heuristic partitioning approach --- p.57Chapter 3.5 --- Experimental Study --- p.62Chapter 3.5.1 --- Data set --- p.63Chapter 3.5.2 --- Study on DP Approach and HP Approach --- p.65Chapter 3.5.3 --- Study on parameter settings --- p.69Chapter 3.5.4 --- Comparison with GA-based & hierarchical clustering methods --- p.81Chapter 3.6 --- Chapter conclusion --- p.90Chapter Chapter 4 --- Application of BTACO-based clustering in XML database system --- p.93Chapter 4.1 --- Introduction --- p.93Chapter 4.2 --- Overview of normalization and vertical partitioning in relational DB design --- p.95Chapter 4.2.1 --- Normalization of relational models in database design --- p.95Chapter 4.2.2 --- Vertical partitioning in database design --- p.98Chapter 4.3 --- Clustering XML documents --- p.100Chapter 4.4 --- Proposed approach using BTACO-based clustering --- p.103Chapter 4.4.1 --- Clustering XML documents by structure --- p.103Chapter 4.4.2 --- Clustering XML documents by user transaction patterns --- p.109Chapter 4.4.3 --- Implementation of Query Manager for our experimental study --- p.114Chapter 4.5 --- Experimental Study --- p.118Chapter 4.5.1 --- Experimental Study on the clustering by structure --- p.118Chapter 4.5.2 --- Experimental Study on the clustering by user access patterns --- p.133Chapter 4.6 --- Chapter conclusion --- p.141Chapter Chapter 5 --- Conclusions --- p.143Chapter 5.1 --- Contributions --- p.144Chapter 5.2 --- Future works --- p.146Bibliography --- p.148Appendix I --- p.156Appendix II --- p.168Index tables for Profile A --- p.168Index tables for Profile B --- p.171Appendix III --- p.17
Data Mining and Machine Learning for Software Engineering
Software engineering is one of the most utilizable research areas for data mining. Developers have attempted to improve software quality by mining and analyzing software data. In any phase of software development life cycle (SDLC), while huge amount of data is produced, some design, security, or software problems may occur. In the early phases of software development, analyzing software data helps to handle these problems and lead to more accurate and timely delivery of software projects. Various data mining and machine learning studies have been conducted to deal with software engineering tasks such as defect prediction, effort estimation, etc. This study shows the open issues and presents related solutions and recommendations in software engineering, applying data mining and machine learning techniques
Advances in Meta-Heuristic Optimization Algorithms in Big Data Text Clustering
This paper presents a comprehensive survey of the meta-heuristic optimization algorithms on the text clustering applications and highlights its main procedures. These Artificial Intelligence (AI) algorithms are recognized as promising swarm intelligence methods due to their successful ability to solve machine learning problems, especially text clustering problems. This paper reviews all of the relevant literature on meta-heuristic-based text clustering applications, including many variants, such as basic, modified, hybridized, and multi-objective methods. As well, the main procedures of text clustering and critical discussions are given. Hence, this review reports its advantages and disadvantages and recommends potential future research paths. The main keywords that have been considered in this paper are text, clustering, meta-heuristic, optimization, and algorithm
Preventing premature convergence and proving the optimality in evolutionary algorithms
http://ea2013.inria.fr//proceedings.pdfInternational audienceEvolutionary Algorithms (EA) usually carry out an efficient exploration of the search-space, but get often trapped in local minima and do not prove the optimality of the solution. Interval-based techniques, on the other hand, yield a numerical proof of optimality of the solution. However, they may fail to converge within a reasonable time due to their inability to quickly compute a good approximation of the global minimum and their exponential complexity. The contribution of this paper is a hybrid algorithm called Charibde in which a particular EA, Differential Evolution, cooperates with a Branch and Bound algorithm endowed with interval propagation techniques. It prevents premature convergence toward local optima and outperforms both deterministic and stochastic existing approaches. We demonstrate its efficiency on a benchmark of highly multimodal problems, for which we provide previously unknown global minima and certification of optimality
Development of a R package to facilitate the learning of clustering techniques
This project explores the development of a tool, in the form of a R package, to ease the process of
learning clustering techniques, how they work and what their pros and cons are. This tool should provide
implementations for several different clustering techniques with explanations in order to allow the student
to get familiar with the characteristics of each algorithm by testing them against several different datasets
while deepening their understanding of them through the explanations. Additionally, these explanations
should adapt to the input data, making the tool not only adept for self-regulated learning but for teaching
too.Grado en IngenierĂa Informátic
- …