Next Issue
Volume 10, December
Previous Issue
Volume 10, June
 
 

Algorithms, Volume 10, Issue 3 (September 2017) – 37 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:
619 KiB  
Article
Type-1 Fuzzy Sets and Intuitionistic Fuzzy Sets
by Krassimir T. Atanassov
Algorithms 2017, 10(3), 106; https://doi.org/10.3390/a10030106 - 13 Sep 2017
Cited by 35 | Viewed by 7391
Abstract
A comparison between type-1 fuzzy sets (T1FSs) and intuitionistic fuzzy sets (IFSs) is made. The operators defined over IFSs that do not have analogues in T1FSs are shown, and such analogues are introduced whenever possible. Full article
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)
Show Figures

Figure 1

6074 KiB  
Article
Performance Analysis of Four Decomposition-Ensemble Models for One-Day-Ahead Agricultural Commodity Futures Price Forecasting
by Deyun Wang, Chenqiang Yue, Shuai Wei and Jun Lv
Algorithms 2017, 10(3), 108; https://doi.org/10.3390/a10030108 - 12 Sep 2017
Cited by 28 | Viewed by 7152
Abstract
Agricultural commodity futures prices play a significant role in the change tendency of these spot prices and the supply–demand relationship of global agricultural product markets. Due to the nonlinear and nonstationary nature of this kind of time series data, it is inevitable for [...] Read more.
Agricultural commodity futures prices play a significant role in the change tendency of these spot prices and the supply–demand relationship of global agricultural product markets. Due to the nonlinear and nonstationary nature of this kind of time series data, it is inevitable for price forecasting research to take this nature into consideration. Therefore, we aim to enrich the existing research literature and offer a new way of thinking about forecasting agricultural commodity futures prices, so that four hybrid models are proposed based on the back propagation neural network (BPNN) optimized by the particle swarm optimization (PSO) algorithm and four decomposition methods: empirical mode decomposition (EMD), wavelet packet transform (WPT), intrinsic time-scale decomposition (ITD) and variational mode decomposition (VMD). In order to verify the applicability and validity of these hybrid models, we select three futures prices of wheat, corn and soybean to conduct the experiment. The experimental results show that (1) all the hybrid models combined with decomposition technique have a better performance than the single PSO–BPNN model; (2) VMD contributes the most in improving the forecasting ability of the PSO–BPNN model, while WPT ranks second; (3) ITD performs better than EMD in both cases of corn and soybean; and (4) the proposed models perform well in the forecasting of agricultural commodity futures prices. Full article
Show Figures

Figure 1

1517 KiB  
Article
A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem
by Shifeng Chen, Rong Chen and Jian Gao
Algorithms 2017, 10(3), 107; https://doi.org/10.3390/a10030107 - 12 Sep 2017
Cited by 38 | Viewed by 8012
Abstract
The dynamic vehicle routing problem (DVRP) is a variant of the Vehicle Routing Problem (VRP) in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a monarch butterfly [...] Read more.
The dynamic vehicle routing problem (DVRP) is a variant of the Vehicle Routing Problem (VRP) in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a monarch butterfly optimization (MBO) algorithm to solve DVRPs, utilizing a greedy strategy. Both migration operation and the butterfly adjusting operator only accept the offspring of butterfly individuals that have better fitness than their parents. To improve performance, a later perturbation procedure is implemented, to maintain a balance between global diversification and local intensification. The computational results indicate that the proposed technique outperforms the existing approaches in the literature for average performance by at least 9.38%. In addition, 12 new best solutions were found. This shows that this proposed technique consistently produces high-quality solutions and outperforms other published heuristics for the DVRP. Full article
Show Figures

Figure 1

516 KiB  
Article
Comparison of Internal Clustering Validation Indices for Prototype-Based Clustering
by Joonas Hämäläinen, Susanne Jauhiainen and Tommi Kärkkäinen
Algorithms 2017, 10(3), 105; https://doi.org/10.3390/a10030105 - 06 Sep 2017
Cited by 78 | Viewed by 9237
Abstract
Clustering is an unsupervised machine learning and pattern recognition method. In general, in addition to revealing hidden groups of similar observations and clusters, their number needs to be determined. Internal clustering validation indices estimate this number without any external information. The purpose of [...] Read more.
Clustering is an unsupervised machine learning and pattern recognition method. In general, in addition to revealing hidden groups of similar observations and clusters, their number needs to be determined. Internal clustering validation indices estimate this number without any external information. The purpose of this article is to evaluate, empirically, characteristics of a representative set of internal clustering validation indices with many datasets. The prototype-based clustering framework includes multiple, classical and robust, statistical estimates of cluster location so that the overall setting of the paper is novel. General observations on the quality of validation indices and on the behavior of different variants of clustering algorithms will be given. Full article
(This article belongs to the Special Issue Clustering Algorithms 2017)
Show Figures

Figure 1

1087 KiB  
Article
Contract-Based Incentive Mechanism for Mobile Crowdsourcing Networks
by Nan Zhao, Menglin Fan, Chao Tian and Pengfei Fan
Algorithms 2017, 10(3), 104; https://doi.org/10.3390/a10030104 - 04 Sep 2017
Cited by 6 | Viewed by 5374
Abstract
Mobile crowdsourcing networks (MCNs) are a promising method of data collecting and processing by leveraging the mobile devices’ sensing and computing capabilities. However, because of the selfish characteristics of the service provider (SP) and mobile users (MUs), crowdsourcing participants only aim to maximize [...] Read more.
Mobile crowdsourcing networks (MCNs) are a promising method of data collecting and processing by leveraging the mobile devices’ sensing and computing capabilities. However, because of the selfish characteristics of the service provider (SP) and mobile users (MUs), crowdsourcing participants only aim to maximize their own benefits. This paper investigates the incentive mechanism between the above two parties to create mutual benefits. By modeling MCNs as a labor market, a contract-based crowdsourcing model with moral hazard is proposed under the asymmetric information scenario. In order to incentivize the potential MUs to participate in crowdsourcing tasks, the optimization problem is formulated to maximize the SP’s utility by jointly examining the crowdsourcing participants’ risk preferences. The impact of crowdsourcing participants’ attitudes of risks on the incentive mechanism has been studied analytically and experimentally. Numerical simulation results demonstrate the effectiveness of the proposed contract design scheme for the crowdsourcing incentive. Full article
Show Figures

Figure 1

5998 KiB  
Article
An Enhanced Dynamic Spectrum Allocation Algorithm Based on Cournot Game in Maritime Cognitive Radio Communication System
by Jingbo Zhang, Henan Yu and Shufang Zhang
Algorithms 2017, 10(3), 103; https://doi.org/10.3390/a10030103 - 03 Sep 2017
Cited by 2 | Viewed by 5688
Abstract
The recent development of maritime transport has resulted in the demand for a wider communication bandwidth being more intense. Cognitive radios can dynamically manage resources in a spectrum. Thus, building a new type of maritime cognitive radio communication system (MCRCS) is an effective [...] Read more.
The recent development of maritime transport has resulted in the demand for a wider communication bandwidth being more intense. Cognitive radios can dynamically manage resources in a spectrum. Thus, building a new type of maritime cognitive radio communication system (MCRCS) is an effective solution. In this paper, the enhanced dynamic spectrum allocation algorithm (EDSAA) is proposed, which is based on the Cournot game model. In EDSAA, the decision-making center (DC) sets the weights according to the detection capability of the secondary user (SU), before adding these weighting coefficients in the price function. Furthermore, the willingness of the SU will reduce after meeting their basic communication needs when it continues to increase the leasable spectrum by adding the elastic model in the SU’s revenue function. On this basis, the profit function is established. The simulation results show that the EDSAA has Nash equilibrium and conforms to the actual situation. It shows that the results of spectrum allocation are fair, efficient and reasonable. Full article
Show Figures

Figure 1

840 KiB  
Article
Local Community Detection in Dynamic Graphs Using Personalized Centrality
by Eisha Nathan, Anita Zakrzewska, Jason Riedy and David A. Bader
Algorithms 2017, 10(3), 102; https://doi.org/10.3390/a10030102 - 29 Aug 2017
Cited by 8 | Viewed by 7406
Abstract
Analyzing massive graphs poses challenges due to the vast amount of data available. Extracting smaller relevant subgraphs allows for further visualization and analysis that would otherwise be too computationally intensive. Furthermore, many real data sets are constantly changing, and require algorithms to update [...] Read more.
Analyzing massive graphs poses challenges due to the vast amount of data available. Extracting smaller relevant subgraphs allows for further visualization and analysis that would otherwise be too computationally intensive. Furthermore, many real data sets are constantly changing, and require algorithms to update as the graph evolves. This work addresses the topic of local community detection, or seed set expansion, using personalized centrality measures, specifically PageRank and Katz centrality. We present a method to efficiently update local communities in dynamic graphs. By updating the personalized ranking vectors, we can incrementally update the corresponding local community. Applying our methods to real-world graphs, we are able to obtain speedups of up to 60× compared to static recomputation while maintaining an average recall of 0.94 of the highly ranked vertices returned. Next, we investigate how approximations of a centrality vector affect the resulting local community. Specifically, our method guarantees that the vertices returned in the community are the highly ranked vertices from a personalized centrality metric. Full article
(This article belongs to the Special Issue Algorithms for Community Detection in Complex Networks)
Show Figures

Figure 1

4449 KiB  
Article
Comparative Study of Type-2 Fuzzy Particle Swarm, Bee Colony and Bat Algorithms in Optimization of Fuzzy Controllers
by Frumen Olivas, Leticia Amador-Angulo, Jonathan Perez, Camilo Caraveo, Fevrier Valdez and Oscar Castillo
Algorithms 2017, 10(3), 101; https://doi.org/10.3390/a10030101 - 28 Aug 2017
Cited by 56 | Viewed by 6698
Abstract
In this paper, a comparison among Particle swarm optimization (PSO), Bee Colony Optimization (BCO) and the Bat Algorithm (BA) is presented. In addition, a modification to the main parameters of each algorithm through an interval type-2 fuzzy logic system is presented. The main [...] Read more.
In this paper, a comparison among Particle swarm optimization (PSO), Bee Colony Optimization (BCO) and the Bat Algorithm (BA) is presented. In addition, a modification to the main parameters of each algorithm through an interval type-2 fuzzy logic system is presented. The main aim of using interval type-2 fuzzy systems is providing dynamic parameter adaptation to the algorithms. These algorithms (original and modified versions) are compared with the design of fuzzy systems used for controlling the trajectory of an autonomous mobile robot. Simulation results reveal that PSO algorithm outperforms the results of the BCO and BA algorithms. Full article
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)
Show Figures

Figure 1

4758 KiB  
Article
Hybrid Learning for General Type-2 TSK Fuzzy Logic Systems
by Mauricio A. Sanchez, Juan R. Castro, Violeta Ocegueda-Miramontes and Leticia Cervantes
Algorithms 2017, 10(3), 99; https://doi.org/10.3390/a10030099 - 25 Aug 2017
Cited by 18 | Viewed by 5511
Abstract
This work is focused on creating fuzzy granular classification models based on general type-2 fuzzy logic systems when consequents are represented by interval type-2 TSK linear functions. Due to the complexity of general type-2 TSK fuzzy logic systems, a hybrid learning approach is [...] Read more.
This work is focused on creating fuzzy granular classification models based on general type-2 fuzzy logic systems when consequents are represented by interval type-2 TSK linear functions. Due to the complexity of general type-2 TSK fuzzy logic systems, a hybrid learning approach is proposed, where the principle of justifiable granularity is heuristically used to define an amount of uncertainty in the system, which in turn is used to define the parameters in the interval type-2 TSK linear functions via a dual LSE algorithm. Multiple classification benchmark datasets were tested in order to assess the quality of the formed granular models; its performance is also compared against other common classification algorithms. Shown results conclude that classification performance in general is better than results obtained by other techniques, and in general, all achieved results, when averaged, have a better performance rate than compared techniques, demonstrating the stability of the proposed hybrid learning technique. Full article
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)
Show Figures

Figure 1

463 KiB  
Article
Biogeography-Based Optimization of the Portfolio Optimization Problem with Second Order Stochastic Dominance Constraints
by Tao Ye, Ziqiang Yang and Siling Feng
Algorithms 2017, 10(3), 100; https://doi.org/10.3390/a10030100 - 25 Aug 2017
Cited by 9 | Viewed by 5047
Abstract
The portfolio optimization problem is the central problem of modern economics and decision theory; there is the Mean-Variance Model and Stochastic Dominance Model for solving this problem. In this paper, based on the second order stochastic dominance constraints, we propose the improved biogeography-based [...] Read more.
The portfolio optimization problem is the central problem of modern economics and decision theory; there is the Mean-Variance Model and Stochastic Dominance Model for solving this problem. In this paper, based on the second order stochastic dominance constraints, we propose the improved biogeography-based optimization algorithm to optimize the portfolio, which we called ε BBO. In order to test the computing power of ε BBO, we carry out two numerical experiments in several kinds of constraints. In experiment 1, comparing the Stochastic Approximation (SA) method with the Level Function (LF) algorithm and Genetic Algorithm (GA), we get a similar optimal solution by ε BBO in [ 0 , 0 . 6 ] and [ 0 , 1 ] constraints with the return of 1.174% and 1.178%. In [ - 1 , 2 ] constraint, we get the optimal return of 1.3043% by ε BBO, while the return of SA and LF is 1.23% and 1.26%. In experiment 2, we get the optimal return of 0.1325% and 0.3197% by ε BBO in [ 0 , 0 . 1 ] and [ - 0 . 05 , 0 . 15 ] constraints. As a comparison, the return of FTSE100 Index portfolio is 0.0937%. The results prove that ε BBO algorithm has great potential in the field of financial decision-making, it also shows that ε BBO algorithm has a better performance in optimization problem. Full article
Show Figures

Figure 1

1767 KiB  
Article
Adaptive Virtual RSU Scheduling for Scalable Coverage under Bidirectional Vehicle Traffic Flow
by Fei Chen, Xiaohong Bi, Ruimin Lyu, Zhongwei Hua, Yuan Liu and Xiaoting Zhang
Algorithms 2017, 10(3), 98; https://doi.org/10.3390/a10030098 - 24 Aug 2017
Cited by 4 | Viewed by 5502
Abstract
Over the past decades, vehicular ad hoc networks (VANETs) have been a core networking technology to provide drivers and passengers with safety and convenience. As a new emerging technology, the vehicular cloud computing (VCC) can provide cloud services for various data-intensive applications in [...] Read more.
Over the past decades, vehicular ad hoc networks (VANETs) have been a core networking technology to provide drivers and passengers with safety and convenience. As a new emerging technology, the vehicular cloud computing (VCC) can provide cloud services for various data-intensive applications in VANETs, such as multimedia streaming. However, the vehicle mobility and intermittent connectivity present challenges to the large-scale data dissemination with underlying computing and networking architecture. In this paper, we will explore the service scheduling of virtual RSUs for diverse request demands in the dynamic traffic flow in vehicular cloud environment. Specifically, we formulate the RSU allocation problem as maximum service capacity with multiple-source and multiple-destination, and propose a bidirectional RSU allocation strategy. In addition, we formulate the content replication in distributed RSUs as the minimum replication set coverage problem in a two-layer mapping model, and analyze the solutions in different scenarios. Numerical results further prove the superiority of our proposed solution, as well as the scalability to various traffic condition variations. Full article
Show Figures

Figure 1

906 KiB  
Article
A Simplified Matrix Formulation for Sensitivity Analysis of Hidden Markov Models
by Seifemichael B. Amsalu,  Abdollah Homaifar and Albert C. Esterline
Algorithms 2017, 10(3), 97; https://doi.org/10.3390/a10030097 - 22 Aug 2017
Cited by 3 | Viewed by 6970
Abstract
In this paper, a new algorithm for sensitivity analysis of discrete hidden Markov models (HMMs) is proposed. Sensitivity analysis is a general technique for investigating the robustness of the output of a system model. Sensitivity analysis of probabilistic networks has recently been studied [...] Read more.
In this paper, a new algorithm for sensitivity analysis of discrete hidden Markov models (HMMs) is proposed. Sensitivity analysis is a general technique for investigating the robustness of the output of a system model. Sensitivity analysis of probabilistic networks has recently been studied extensively. This has resulted in the development of mathematical relations between a parameter and an output probability of interest and also methods for establishing the effects of parameter variations on decisions. Sensitivity analysis in HMMs has usually been performed by taking small perturbations in parameter values and re-computing the output probability of interest. As recent studies show, the sensitivity analysis of an HMM can be performed using a functional relationship that describes how an output probability varies as the network’s parameters of interest change. To derive this sensitivity function, existing Bayesian network algorithms have been employed for HMMs. These algorithms are computationally inefficient as the length of the observation sequence and the number of parameters increases. In this study, a simplified efficient matrix-based algorithm for computing the coefficients of the sensitivity function for all hidden states and all time steps is proposed and an example is presented. Full article
Show Figures

Figure 1

784 KiB  
Article
Double-Threshold Cooperative Spectrum Sensing Algorithm Based on Sevcik Fractal Dimension
by Xueying Diao, Qianhui Dong, Zijian Yang and Yibing Li
Algorithms 2017, 10(3), 96; https://doi.org/10.3390/a10030096 - 21 Aug 2017
Cited by 7 | Viewed by 4714
Abstract
Spectrum sensing is of great importance in the cognitive radio (CR) networks. Compared with individual spectrum sensing, cooperative spectrum sensing (CSS) has been shown to greatly improve the accuracy of the detection. However, the existing CSS algorithms are sensitive to noise uncertainty and [...] Read more.
Spectrum sensing is of great importance in the cognitive radio (CR) networks. Compared with individual spectrum sensing, cooperative spectrum sensing (CSS) has been shown to greatly improve the accuracy of the detection. However, the existing CSS algorithms are sensitive to noise uncertainty and are inaccurate in low signal-to-noise ratio (SNR) detection. To address this, we propose a double-threshold CSS algorithm based on Sevcik fractal dimension (SFD) in this paper. The main idea of the presented scheme is to sense the presence of primary users in the local spectrum sensing by analyzing different characteristics of the SFD between signals and noise. Considering the stochastic fluctuation characteristic of the noise SFD in a certain range, we adopt the double-threshold method in the multi-cognitive user CSS so as to improve the detection accuracy, where thresholds are set according to the maximum and minimum values of the noise SFD. After obtaining the detection results, the cognitive user sends local detection results to the fusion center for reliability fusion. Simulation results demonstrate that the proposed method is insensitive to noise uncertainty. Simulations also show that the algorithm presented in this paper can achieve high detection performance at the low SNR region. Full article
Show Figures

Figure 1

247 KiB  
Article
A Parallel Two-Stage Iteration Method for Solving Continuous Sylvester Equations
by Manyu Xiao, Quanyi Lv, Zhuo Xing and Yingchun Zhang
Algorithms 2017, 10(3), 95; https://doi.org/10.3390/a10030095 - 21 Aug 2017
Cited by 6 | Viewed by 3971
Abstract
In this paper we propose a parallel two-stage iteration algorithm for solving large-scale continuous Sylvester equations. By splitting the coefficient matrices, the original linear system is transformed into a symmetric linear system which is then solved by using the SYMMLQ algorithm. In order [...] Read more.
In this paper we propose a parallel two-stage iteration algorithm for solving large-scale continuous Sylvester equations. By splitting the coefficient matrices, the original linear system is transformed into a symmetric linear system which is then solved by using the SYMMLQ algorithm. In order to improve the relative parallel efficiency, an adjusting strategy is explored during the iteration calculation of the SYMMLQ algorithm to decrease the degree of the reduce-operator from two to one communications at each step. Moreover, the convergence of the iteration scheme is discussed, and finally numerical results are reported showing that the proposed method is an efficient and robust algorithm for this class of continuous Sylvester equations on a parallel machine. Full article
3034 KiB  
Article
NBTI and Power Reduction Using an Input Vector Control and Supply Voltage Assignment Method
by Peng Sun, Zhiming Yang, Yang Yu, Junbao Li and Xiyuan Peng
Algorithms 2017, 10(3), 94; https://doi.org/10.3390/a10030094 - 19 Aug 2017
Cited by 5 | Viewed by 5604
Abstract
As technology scales, negative bias temperature instability (NBTI) becomes one of the primary failure mechanisms for Very Large Scale Integration (VLSI) circuits. Meanwhile, the leakage power increases dramatically as the supply/threshold voltage continues to scale down. These two issues pose severe reliability problems [...] Read more.
As technology scales, negative bias temperature instability (NBTI) becomes one of the primary failure mechanisms for Very Large Scale Integration (VLSI) circuits. Meanwhile, the leakage power increases dramatically as the supply/threshold voltage continues to scale down. These two issues pose severe reliability problems for complementary metal oxide semiconductor (CMOS) devices. Because both the NBTI and leakage are dependent on the input vector of the circuit, we present an input vector control (IVC) method based on a linear programming algorithm, which can co-optimize circuit aging and power dissipation simultaneously. In addition, our proposed IVC method is combined with the supply voltage assignment technique to further reduce delay degradation and leakage power. Experimental results on various circuits show the effectiveness of the proposed combination method. Full article
Show Figures

Figure 1

6529 KiB  
Article
Post-Processing Partitions to Identify Domains of Modularity Optimization
by William H. Weir, Scott Emmons, Ryan Gibson, Dane Taylor and Peter J. Mucha
Algorithms 2017, 10(3), 93; https://doi.org/10.3390/a10030093 - 19 Aug 2017
Cited by 35 | Viewed by 8171
Abstract
We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions, CHAMP identifies the domain of modularity optimization for each partition—i.e., [...] Read more.
We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions, CHAMP identifies the domain of modularity optimization for each partition—i.e., the parameter-space domain where it has the largest modularity relative to the input set—discarding partitions with empty domains to obtain the subset of partitions that are “admissible” candidate community structures that remain potentially optimal over indicated parameter domains. Importantly, CHAMP can be used for multi-dimensional parameter spaces, such as those for multilayer networks where one includes a resolution parameter and interlayer coupling. Using the results from CHAMP, a user can more appropriately select robust community structures by observing the sizes of domains of optimization and the pairwise comparisons between partitions in the admissible subset. We demonstrate the utility of CHAMP with several example networks. In these examples, CHAMP focuses attention onto pruned subsets of admissible partitions that are 20-to-1785 times smaller than the sets of unique partitions obtained by community detection heuristics that were input into CHAMP. Full article
(This article belongs to the Special Issue Algorithms for Community Detection in Complex Networks)
Show Figures

Figure 1

326 KiB  
Letter
Automatic Modulation Recognition Using Compressive Cyclic Features
by Lijin Xie and Qun Wan
Algorithms 2017, 10(3), 92; https://doi.org/10.3390/a10030092 - 18 Aug 2017
Cited by 8 | Viewed by 3888
Abstract
Higher-order cyclic cumulants (CCs) have been widely adopted for automatic modulation recognition (AMR) in cognitive radio. However, the CC-based AMR suffers greatly from the requirement of high-rate sampling. To overcome this limit, we resort to the theory of compressive sensing (CS). By exploiting [...] Read more.
Higher-order cyclic cumulants (CCs) have been widely adopted for automatic modulation recognition (AMR) in cognitive radio. However, the CC-based AMR suffers greatly from the requirement of high-rate sampling. To overcome this limit, we resort to the theory of compressive sensing (CS). By exploiting the sparsity of CCs, recognition features can be extracted from a small amount of compressive measurements via a rough CS reconstruction algorithm. Accordingly, a CS-based AMR scheme is formulated. Simulation results demonstrate the availability and robustness of the proposed approach. Full article
Show Figures

Figure 1

889 KiB  
Article
Transformation-Based Fuzzy Rule Interpolation Using Interval Type-2 Fuzzy Sets
by Chengyuan Chen and Qiang Shen
Algorithms 2017, 10(3), 91; https://doi.org/10.3390/a10030091 - 15 Aug 2017
Cited by 7 | Viewed by 5262
Abstract
In support of reasoning with sparse rule bases, fuzzy rule interpolation (FRI) offers a helpful inference mechanism for deriving an approximate conclusion when a given observation has no overlap with any rule in the existing rule base. One of the recent and popular [...] Read more.
In support of reasoning with sparse rule bases, fuzzy rule interpolation (FRI) offers a helpful inference mechanism for deriving an approximate conclusion when a given observation has no overlap with any rule in the existing rule base. One of the recent and popular FRI approaches is the scale and move transformation-based rule interpolation, known as T-FRI in the literature. It supports both interpolation and extrapolation with multiple multi-antecedent rules. However, the difficult problem of defining the precise-valued membership functions required in the representation of fuzzy rules, or of the observations, restricts its applications. Fortunately, this problem can be alleviated through the use of type-2 fuzzy sets, owing to the fact that the membership functions of such fuzzy sets are themselves fuzzy, providing a more flexible means of modelling. This paper therefore, extends the existing T-FRI approach using interval type-2 fuzzy sets, which covers the original T-FRI as its specific instance. The effectiveness of this extension is demonstrated by experimental investigations and, also, by a practical application in comparison to the state-of-the-art alternative approach developed using rough-fuzzy sets. Full article
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)
Show Figures

Figure 1

464 KiB  
Article
Local Community Detection Based on Small Cliques
by Michael Hamann, Eike Röhrs and Dorothea Wagner
Algorithms 2017, 10(3), 90; https://doi.org/10.3390/a10030090 - 11 Aug 2017
Cited by 11 | Viewed by 5481
Abstract
Community detection aims to find dense subgraphs in a network. We consider the problem of finding a community locally around a seed node both in unweighted and weighted networks. This is a faster alternative to algorithms that detect communities that cover the whole [...] Read more.
Community detection aims to find dense subgraphs in a network. We consider the problem of finding a community locally around a seed node both in unweighted and weighted networks. This is a faster alternative to algorithms that detect communities that cover the whole network when actually only a single community is required. Further, many overlapping community detection algorithms use local community detection algorithms as basic building block. We provide a broad comparison of different existing strategies of expanding a seed node greedily into a community. For this, we conduct an extensive experimental evaluation both on synthetic benchmark graphs as well as real world networks. We show that results both on synthetic as well as real-world networks can be significantly improved by starting from the largest clique in the neighborhood of the seed node. Further, our experiments indicate that algorithms using scores based on triangles outperform other algorithms in most cases. We provide theoretical descriptions as well as open source implementations of all algorithms used. Full article
(This article belongs to the Special Issue Algorithms for Community Detection in Complex Networks)
Show Figures

Figure 1

282 KiB  
Article
On the Existence of Solutions of Nonlinear Fredholm Integral Equations from Kantorovich’s Technique
by José Antonio Ezquerro and Miguel Ángel Hernández-Verón
Algorithms 2017, 10(3), 89; https://doi.org/10.3390/a10030089 - 02 Aug 2017
Cited by 12 | Viewed by 4143
Abstract
The well-known Kantorovich technique based on majorizing sequences is used to analyse the convergence of Newton’s method when it is used to solve nonlinear Fredholm integral equations. In addition, we obtain information about the domains of existence and uniqueness of a solution for [...] Read more.
The well-known Kantorovich technique based on majorizing sequences is used to analyse the convergence of Newton’s method when it is used to solve nonlinear Fredholm integral equations. In addition, we obtain information about the domains of existence and uniqueness of a solution for these equations. Finally, we illustrate the above with two particular Fredholm integral equations. Full article
(This article belongs to the Special Issue Numerical Algorithms for Solving Nonlinear Equations and Systems 2017)
4338 KiB  
Article
On the Lagged Diffusivity Method for the Solution of Nonlinear Finite Difference Systems
by Francesco Mezzadri and Emanuele Galligani
Algorithms 2017, 10(3), 88; https://doi.org/10.3390/a10030088 - 02 Aug 2017
Cited by 1 | Viewed by 4566
Abstract
In this paper, we extend the analysis of the Lagged Diffusivity Method for nonlinear, non-steady reaction-convection-diffusion equations. In particular, we describe how the method can be used to solve the systems arising from different discretization schemes, recalling some results on the convergence of [...] Read more.
In this paper, we extend the analysis of the Lagged Diffusivity Method for nonlinear, non-steady reaction-convection-diffusion equations. In particular, we describe how the method can be used to solve the systems arising from different discretization schemes, recalling some results on the convergence of the method itself. Moreover, we also analyze the behavior of the method in case of problems presenting boundary layers or blow-up solutions. Full article
(This article belongs to the Special Issue Numerical Algorithms for Solving Nonlinear Equations and Systems 2017)
Show Figures

Figure 1

334 KiB  
Article
Auxiliary Model Based Multi-Innovation Stochastic Gradient Identification Algorithm for Periodically Non-Uniformly Sampled-Data Hammerstein Systems
by Li Xie and Huizhong Yang
Algorithms 2017, 10(3), 84; https://doi.org/10.3390/a10030084 - 31 Jul 2017
Cited by 3 | Viewed by 4959
Abstract
Due to the lack of powerful model description methods, the identification of Hammerstein systems based on the non-uniform input-output dataset remains a challenging problem. This paper introduces a time-varying backward shift operator to describe periodically non-uniformly sampled-data Hammerstein systems, which can simplify the [...] Read more.
Due to the lack of powerful model description methods, the identification of Hammerstein systems based on the non-uniform input-output dataset remains a challenging problem. This paper introduces a time-varying backward shift operator to describe periodically non-uniformly sampled-data Hammerstein systems, which can simplify the structure of the lifted models using the traditional lifting technique. Furthermore, an auxiliary model-based multi-innovation stochastic gradient algorithm is presented to estimate the parameters involved in the linear and nonlinear blocks. The simulation results confirm that the proposed algorithm is effective and can achieve a high estimation performance. Full article
Show Figures

Figure 1

44006 KiB  
Article
Evolutionary Optimization for Robust Epipolar-Geometry Estimation and Outlier Detection
by Mozhdeh Shahbazi, Gunho Sohn and Jérôme Théau
Algorithms 2017, 10(3), 87; https://doi.org/10.3390/a10030087 - 27 Jul 2017
Cited by 10 | Viewed by 7611
Abstract
In this paper, a robust technique based on a genetic algorithm is proposed for estimating two-view epipolar-geometry of uncalibrated perspective stereo images from putative correspondences containing a high percentage of outliers. The advantages of this technique are three-fold: (i) replacing random search with [...] Read more.
In this paper, a robust technique based on a genetic algorithm is proposed for estimating two-view epipolar-geometry of uncalibrated perspective stereo images from putative correspondences containing a high percentage of outliers. The advantages of this technique are three-fold: (i) replacing random search with evolutionary search applying new strategies of encoding and guided sampling; (ii) robust and fast estimation of the epipolar geometry via detecting a more-than-enough set of inliers without making any assumptions about the probability distribution of the residuals; (iii) determining the inlier-outlier threshold based on the uncertainty of the estimated model. The proposed method was evaluated both on synthetic data and real images. The results were compared with the most popular techniques from the state-of-the-art, including RANSAC (random sample consensus), MSAC, MLESAC, Cov-RANSAC, LO-RANSAC, StaRSAC, Multi-GS RANSAC and least median of squares (LMedS). Experimental results showed that the proposed approach performed better than other methods regarding the accuracy of inlier detection and epipolar-geometry estimation, as well as the computational efficiency for datasets majorly contaminated by outliers and noise. Full article
Show Figures

Figure 1

908 KiB  
Article
An Improved MOEA/D with Optimal DE Schemes for Many-Objective Optimization Problems
by Wei Zheng, Yanyan Tan, Xiaonan Fang and Shengtao Li
Algorithms 2017, 10(3), 86; https://doi.org/10.3390/a10030086 - 26 Jul 2017
Cited by 6 | Viewed by 5631
Abstract
MOEA/D is a promising multi-objective evolutionary algorithm based on decomposition, and it has been used to solve many multi-objective optimization problems very well. However, there is a class of multi-objective problems, called many-objective optimization problems, but the original MOEA/D cannot solve them well. [...] Read more.
MOEA/D is a promising multi-objective evolutionary algorithm based on decomposition, and it has been used to solve many multi-objective optimization problems very well. However, there is a class of multi-objective problems, called many-objective optimization problems, but the original MOEA/D cannot solve them well. In this paper, an improved MOEA/D with optimal differential evolution (oDE) schemes is proposed, called MOEA/D-oDE, aiming to solve many-objective optimization problems. Compared with MOEA/D, MOEA/D-oDE has two distinguishing points. On the one hand, MOEA/D-oDE adopts a newly-introduced decomposition approach to decompose the many-objective optimization problems, which combines the advantages of the weighted sum approach and the Tchebycheff approach. On the other hand, a kind of combination mechanism for DE operators is designed for finding the best child solution so as to do the a posteriori computing. In our experimental study, six continuous test instances with 4–6 objectives comparing NSGA-II (nondominated sorting genetic algorithm II) and MOEA/D as accompanying experiments are applied. Additionally, the final results indicate that MOEA/D-oDE outperforms NSGA-II and MOEA/D in almost all cases, particularly in those problems that have complicated Pareto shapes and higher dimensional objectives, where its advantages are more obvious. Full article
(This article belongs to the Special Issue Evolutionary Computation for Multiobjective Optimization)
Show Figures

Figure 1

2842 KiB  
Article
A New Meta-Heuristics of Optimization with Dynamic Adaptation of Parameters Using Type-2 Fuzzy Logic for Trajectory Control of a Mobile Robot
by Camilo Caraveo, Fevrier Valdez and Oscar Castillo
Algorithms 2017, 10(3), 85; https://doi.org/10.3390/a10030085 - 26 Jul 2017
Cited by 38 | Viewed by 7068
Abstract
Fuzzy logic is a soft computing technique that has been very successful in recent years when it is used as a complement to improve meta-heuristic optimization. In this paper, we present a new variant of the bio-inspired optimization algorithm based on the self-defense [...] Read more.
Fuzzy logic is a soft computing technique that has been very successful in recent years when it is used as a complement to improve meta-heuristic optimization. In this paper, we present a new variant of the bio-inspired optimization algorithm based on the self-defense mechanisms of plants in the nature. The optimization algorithm proposed in this work is based on the predator-prey model originally presented by Lotka and Volterra, where two populations interact with each other and the objective is to maintain a balance. The system of predator-prey equations use four variables (α, β, λ, δ) and the values of these variables are very important since they are in charge of maintaining a balance between the pair of equations. In this work, we propose the use of Type-2 fuzzy logic for the dynamic adaptation of the variables of the system. This time a fuzzy controller is in charge of finding the optimal values for the model variables, the use of this technique will allow the algorithm to have a higher performance and accuracy in the exploration of the values. Full article
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)
Show Figures

Figure 1

4717 KiB  
Article
Fuzzy Fireworks Algorithm Based on a Sparks Dispersion Measure
by Juan Barraza, Patricia Melin, Fevrier Valdez and Claudia I. Gonzalez
Algorithms 2017, 10(3), 83; https://doi.org/10.3390/a10030083 - 21 Jul 2017
Cited by 20 | Viewed by 5486
Abstract
The main goal of this paper is to improve the performance of the Fireworks Algorithm (FWA). To improve the performance of the FWA we propose three modifications: the first modification is to change the stopping criteria, this is to say, previously, the number [...] Read more.
The main goal of this paper is to improve the performance of the Fireworks Algorithm (FWA). To improve the performance of the FWA we propose three modifications: the first modification is to change the stopping criteria, this is to say, previously, the number of function evaluations was utilized as a stopping criteria, and we decided to change this to specify a particular number of iterations; the second and third modifications consist on introducing a dispersion metric (dispersion percent), and both modifications were made with the goal of achieving dynamic adaptation of the two parameters in the algorithm. The parameters that were controlled are the explosion amplitude and the number of sparks, and it is worth mentioning that the control of these parameters is based on a fuzzy logic approach. To measure the impact of these modifications, we perform experiments with 14 benchmark functions and a comparative study shows the advantage of the proposed approach. We decided to call the proposed algorithms Iterative Fireworks Algorithm (IFWA) and two variants of the Dispersion Percent Iterative Fuzzy Fireworks Algorithm (DPIFWA-I and DPIFWA-II, respectively). Full article
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)
Show Figures

Figure 1

4833 KiB  
Article
Optimization of Intelligent Controllers Using a Type-1 and Interval Type-2 Fuzzy Harmony Search Algorithm
by Cinthia Peraza, Fevrier Valdez and Patricia Melin
Algorithms 2017, 10(3), 82; https://doi.org/10.3390/a10030082 - 20 Jul 2017
Cited by 38 | Viewed by 5507
Abstract
This article focuses on the dynamic parameter adaptation in the harmony search algorithm using Type-1 and interval Type-2 fuzzy logic. In particular, this work focuses on the adaptation of the parameters of the original harmony search algorithm. At present there are several types [...] Read more.
This article focuses on the dynamic parameter adaptation in the harmony search algorithm using Type-1 and interval Type-2 fuzzy logic. In particular, this work focuses on the adaptation of the parameters of the original harmony search algorithm. At present there are several types of algorithms that can solve complex real-world problems with uncertainty management. In this case the proposed method is in charge of optimizing the membership functions of three benchmark control problems (water tank, shower, and mobile robot). The main goal is to find the best parameters for the membership functions in the controller to follow a desired trajectory. Noise experiments are performed to test the efficacy of the method. Full article
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)
Show Figures

Figure 1

385 KiB  
Article
Low-Resource Cross-Domain Product Review Sentiment Classification Based on a CNN with an Auxiliary Large-Scale Corpus
by Xiaocong Wei, Hongfei Lin, Yuhai Yu and Liang Yang
Algorithms 2017, 10(3), 81; https://doi.org/10.3390/a10030081 - 19 Jul 2017
Cited by 20 | Viewed by 5477
Abstract
The literature [-5]contains several reports evaluating the abilities of deep neural networks in text transfer learning. To our knowledge, however, there have been few efforts to fully realize the potential of deep neural networks in cross-domain product review sentiment classification. In this paper, [...] Read more.
The literature [-5]contains several reports evaluating the abilities of deep neural networks in text transfer learning. To our knowledge, however, there have been few efforts to fully realize the potential of deep neural networks in cross-domain product review sentiment classification. In this paper, we propose a two-layer convolutional neural network (CNN) for cross-domain product review sentiment classification (LM-CNN-LB). Transfer learning research into product review sentiment classification based on deep neural networks has been limited by the lack of a large-scale corpus; we sought to remedy this problem using a large-scale auxiliary cross-domain dataset collected from Amazon product reviews. Our proposed framework exhibits the dramatic transferability of deep neural networks for cross-domain product review sentiment classification and achieves state-of-the-art performance. The framework also outperforms complex engineered features used with a non-deep neural network method. The experiments demonstrate that introducing large-scale data from similar domains is an effective way to resolve the lack of training data. The LM-CNN-LB trained on the multi-source related domain dataset outperformed the one trained on a single similar domain. Full article
Show Figures

Figure 1

23357 KiB  
Article
A Hybrid Algorithm for Optimal Wireless Sensor Network Deployment with the Minimum Number of Sensor Nodes
by Yasser El Khamlichi, Abderrahim Tahiri, Anouar Abtoy, Inmaculada Medina-Bulo and Francisco Palomo-Lozano
Algorithms 2017, 10(3), 80; https://doi.org/10.3390/a10030080 - 18 Jul 2017
Cited by 25 | Viewed by 10172
Abstract
Wireless sensor network (WSN) applications are rapidly growing and are widely used in various disciplines. Deployment is one of the key issues to be solved in WSNs, since the sensor nodes’ positioning affects highly the system performance. An optimal WSN deployment should maximize [...] Read more.
Wireless sensor network (WSN) applications are rapidly growing and are widely used in various disciplines. Deployment is one of the key issues to be solved in WSNs, since the sensor nodes’ positioning affects highly the system performance. An optimal WSN deployment should maximize the collection of the desired interest phenomena, guarantee the required coverage and connectivity, extend the network lifetime, and minimize the network cost in terms of energy consumption. Most of the research effort in this area aims to solve the deployment issue, without minimizing the network cost by reducing unnecessary working nodes in the network. In this paper, we propose a deployment approach based on the gradient method and the Simulated Annealing algorithm to solve the sensor deployment problem with the minimum number of sensor nodes. The proposed algorithm is able to heuristically optimize the number of sensors and their positions in order to achieve the desired application requirements. Full article
Show Figures

Figure 1

8040 KiB  
Article
Design of an Optimized Fuzzy Classifier for the Diagnosis of Blood Pressure with a New Computational Method for Expert Rule Optimization
by Juan Carlos Guzman, Patricia Melin and German Prado-Arechiga
Algorithms 2017, 10(3), 79; https://doi.org/10.3390/a10030079 - 14 Jul 2017
Cited by 25 | Viewed by 6415
Abstract
A neuro fuzzy hybrid model (NFHM) is proposed as a new artificial intelligence method to classify blood pressure (BP). The NFHM uses techniques such as neural networks, fuzzy logic and evolutionary computation, and in the last case genetic algorithms (GAs) are used. The [...] Read more.
A neuro fuzzy hybrid model (NFHM) is proposed as a new artificial intelligence method to classify blood pressure (BP). The NFHM uses techniques such as neural networks, fuzzy logic and evolutionary computation, and in the last case genetic algorithms (GAs) are used. The main goal is to model the behavior of blood pressure based on monitoring data of 24 h per patient and based on this to obtain the trend, which is classified using a fuzzy system based on rules provided by an expert, and these rules are optimized by a genetic algorithm to obtain the best possible number of rules for the classifier with the lowest classification error. Simulation results are presented to show the advantage of the proposed model. Full article
(This article belongs to the Special Issue Extensions to Type-1 Fuzzy Logic: Theory, Algorithms and Applications)
Show Figures

Figure 1

Previous Issue
Next Issue
Back to TopTop