PARTICLE SWARM OPTIMIZATION FOR MULTIDIMENSIONAL CLUSTERING OF NATURAL LANGUAGE DATA
|
|
- August Matthews
- 5 years ago
- Views:
Transcription
1 International Journal of Civil Engineering and Technology (IJCIET) Volume 9, Issue 11, November 2018, pp , Article ID: IJCIET_09_11_014 Available online at ISSN Print: and ISSN Online: IAEME Publication Scopus Indexed PARTICLE SWARM OPTIMIZATION FOR MULTIDIMENSIONAL CLUSTERING OF NATURAL LANGUAGE DATA G.A. Yuryev, E.K. Verkhovskaya and N.E. Yuryeva Federal State Budget Educational Institution of Higher Education "Moscow State University of Psychology and Education", Moscow, Russia ABSTRACT Consider a non-linear dimensionality reduction method which takes into account the discriminating power of the solution found for given values of the categorical variable associated with each observation. Stochastic optimization method known as the "Particle swarm optimization" is proposed to found characteristics that ensure the best separation of observations in terms of a given quality functional. The basis for evaluating the quality of the solution lies in the purity of the clusters obtained with the k-means method, or with using self-organizing Kohonen feature maps. Keywords: Stochastic Optimization, Text Analysis, Swarm Clustering. Cite this Article: G.A. Yuryev, E.K. Verkhovskaya and N.E. Yuryeva, Particle Swarm Optimization for Multidimensional Clustering of Natural Language Data, International Journal of Civil Engineering and Technology, 9(11), 2018, pp INTRODUCTION This article considers a method for the dimensionality reduction of multidimensional data, taking into account the discriminatory power of the solution found for given values of the categorical variable associated with each observation. In order to search for features ensuring that the observations are best distinguished in terms of a given quality functional, it is proposed to use a numerical procedure based on the stochastic optimization method known as the "Particle swarm method". The quality assessment of the solution is based on the purity of the clusters obtained in the space found using k-means clustering. As a result of applying this method to any vector component subset of the original dimension, the coordinates of a given number of principal points (centroids) are obtained, which allow us to determine whether any observation of the original sample belongs to the corresponding clusters. The structure and composition of the resulting clusters will be determined with a specific component subset of the original multidimensional characteristic vector (and, to a certain extent, with the initial coordinates of the centroids, usually chosen randomly). The result of "learning" (clustering) editor@iaeme.com
2 Particle Swarm Optimization for Multidimensional Clustering of Natural Language Data will be the coordinates of centroids found in the given characteristic space, which ensure the best division of the set of observations. If a categorical variable is specified, where the value is known for all observations of the training sample, a quality functional associated with the purity of the classes found in the context of this categorical variable can be specified for any clustering result. Then the search for a component subset of discriminant classes that are optimal for discrimination can be considered a combinatorial task to search for one of 2N (where N is the dimension of the original feature space) parameter combinations that provides the best values of the given quality functional. The task to reduce the original dimensionality of the feature space with quasi-optimal discrimination, then formulated according to a given category, was considered as a combinatorial optimization task. A stochastic method was proposed to solve it using a multicomponent quality functional. 2. FORMULATION OF THE TASKS A sample of observations is given, where { }, is a set of observations, characterized by class and multidimensional parametric vector, { }, one of possible values of categorical variable, { } parametric vector of real components (coordinates of the observation in the k- dimensional space). It is necessary to determine the set of components from - { } { },, from unique, such that { } provides quasioptimal values of the quality functional ( ). 3. THE CONCEPT OF THE QUALITY FUNCTIONAL OF THE FEATURE SPACE FOUND The quality functional ( ) is defined, large values, which will correspond to the results of clustering with greater cluster homogeneity. The k-means clustering method is used with centroid initialization using random values or any other suitable method. Homogeneity will be defined as a generalized measure of the deviation in the number of observations for a given class { } of "winners" in each cluster from the total number of observations assigned to the given class (hereinafter, the partial homogeneity ) and the generalized deviation of the number of unique observation classes in each cluster from 1 (hereinafter formation homogeneity ). If the number of observations of each class in V is comparable, it is advisable to supplement the quality functional with a characteristic reflecting the generalized deviation of the volume of resultant clusters from the expected volume (for example, from the average arithmetic volume l/n), the term weighting W will be hereinafter used to refer to this parameter. 4. GRAPHICAL REPRESENTATION OF STRUCTURAL CHARACTERISTICS OF THE CLUSTERING RESULTS To illustrate the results of applying the proposed algorithm, a graphic representation of the cluster structure purity proposed by the researcher Narayana Swamy [1] will be used [5]. Since this form of representation (Fig. 1) is not standardized, a short explanation will be given on its interpretation editor@iaeme.com
3 G.A. Yuryev, E.K. Verkhovskaya and N.E. Yuryeva Figure 1 Example of a cluster purity diagram It is assumed that class tags of clustered observations are known in advance and their values are listed in the legend on the right-hand side of Fig. 1. Each of the classes is associated with a color code, also reflected in the legend. A set of concentric circles is placed in the main part of the diagram, whereby their numbers correspond to the number of clusters obtained during the clustering procedure (9 for the example in Fig. 1). The ratio of the areas of the inner circles relative to each other corresponds to the ratio of the volumes of the corresponding clusters. The size of the sectors in the inner circles corresponds to the volume of class observations with the corresponding color coding in the corresponding cluster, for example, in the cluster represented by the left upper circle, most of the observations are assigned to the class c4 with a red color code. 5. PRACTICAL ASSESSMENTS OF THE QUALITY FUNCTIONAL Formal estimates of each ( ), previously listed, can be given. Before starting the calculations, the clustering result should be obtained using the k-means clustering method, the set of j resulting clusters will be further denoted as { }, where { } { } the set of z class labels corresponding to observations assigned to the given cluster. Let ( { } ) function return the absolute number of class labels that have the maximum share in the i-th cluster. Then partial homogeneity can be estimated as ( (1) where - is the number of observations relating to cluster as a result of clustering. The result of maximizing partial homogeneity on the sample data for a fixed number of clusters is reflected in Fig editor@iaeme.com
4 Particle Swarm Optimization for Multidimensional Clustering of Natural Language Data Figure 2 Result of maximizing partial homogeneity Let ( { } ) be the function that returns the number of unique class labels in the i-th cluster. Then formation homogeneity ( (2) The result of maximizing formation homogeneity on the same data array is reflected in Fig. 3 Figure 3 Result of maximizing formation homogeneity Despite the similarity in the results of maximizing both criteria, it is easy to see that in the first case (Fig. 2), preference is given to increasing the share of the winning class in each of the clusters, while in the second case (Figure 3), preference is given to the smaller number of classes represented within the same cluster. The weighting estimate based on the assumption of equal sizes of resultant clusters is given as ( (3) where - is the number of observations relating to cluster as a result of clustering, l total sample size. The result of maximizing weighting with the same initial data is shown in Fig editor@iaeme.com
5 G.A. Yuryev, E.K. Verkhovskaya and N.E. Yuryeva Figure 4 Result of maximizing weighting The cumulative quality functional can be written as follows ( ) (4) where, and are the gain factors corresponding to the components of the given quality functional, allowing to designate the desired characteristics of the clustering results obtained in the optimization process. The result of maximizing the total quality functional for equal pairs, and, is reflected in Fig. 5. Figure 5 Result of maximizing the three-component quality function The value of ( ) tends towards one, strict equality to 1 is achieved with the described evaluation procedures in the case when all clusters are of equal size and when within each of the clusters there are observations of only one class. 6. STOCHASTIC SOLUTION OF THE COMBINATORIAL OPTIMIZATION TASK The solution of optimization tasks that do not have an explicit analytical interpretation often involve search methods for quasi-optimal parameters based on numerical estimates of the gradient of the quality functional or on stochastic methods of directed search [2, 3]. This section describes the stochastic optimization method based on the "particle swarm" method applied to the formulated dimensionality reduction task. The original idea of the "particle swarm" method was proposed and developed in studies [4, 5, 6] the original algorithm was applied to model the social behavior of birds, bees and other animals characterized by spatial movement within large groups (swarms). Later, it was noted that it is possible to use this model effectively to study feature spaces, in particular, to search for quasi-optimal solutions of multidimensional optimization tasks. Swarm optimization algorithms can be referred to as evolutionary, whereby the general scheme for enumeration of solutions is described by the following a sequence of steps: editor@iaeme.com
6 Particle Swarm Optimization for Multidimensional Clustering of Natural Language Data 1. A population of "individuals" is generated, each of which contains some random solution of the target task. The search for a solution is represented by an iterative process (steps 2 and 3). In each iteration (epoch), the decisions (positions) of all individuals are slightly modified according to the rules ensuring the convergence of the iterative process to quasi-optimal solutions. 2. The direction of the change in the position of each individual is calculated, depending on its current position, the best solution of the given individual throughout its "existence" (local extremum) and the best known solution (obtained by any individual) for the entire population (global extremum). 3. New positions of the individuals (their coordinates) are computed in accordance with the directions obtained in step The stopping criteria are checked, if the solution parameters do not match, go to step 2, otherwise the search is interrupted. The balance between local and global trends in the behavior of individuals is determined by the coefficients interpreted as the acceleration of the movement of individuals towards the local and global extremes. The original formulation of the task meant a real solution space, making it impossible to use the method in linear programming tasks, in particular, combinatorial optimization tasks. A number of authors proposed the adaptation of the method to linear tasks [7], while the "accelerations" received a probabilistic interpretation. Let us consider in more detail the modified version of the algorithm described in [7], which can be used to find quasi-optimal ones in terms of ( ) for values { }. Search for optimal combinations of parameters from { } can be formulated as the task of "assembling a multidimensional backpack" with a single sampling. Its solution { } can be represented as vector P={ }, where { }, its components with numbers from m equal to 1, and all others 0, that is 1 in the i-th position P indicates that enters the component subset, selected for clustering. The population of individuals consists of d solutions, each of the individuals stores the current solution, the best solution and two vectors,, that determine the inversion frequency of each of the k bits in each of the possible directions. - probability of replacing 1 with 0 in position for the i-th individual, - probability of replacing 0 with 1 in position for the i-th individual. The values, will change at each iteration, as will the positions of the individuals. For the positions of each individual at each iteration the probability of inversion of each bit denoted as, it will be determined based on its current position according to the following rule { (5) The acceleration derivatives, will be affected by their current values, the best local solution, the best global solution and the coefficient of inertia. ( ) ( ) (6) ( ) ( ) (7) editor@iaeme.com
7 G.A. Yuryev, E.K. Verkhovskaya and N.E. Yuryeva To calculate ( and ( ) two scaling factors are used and, the values of which lie within {0 1}, they form a balance between local and global trends in the derivative position obtained. In addition, at each iteration, another pair of scaling values is randomly generated and within limits {0 1}. The final values are formed according to the following rule: { ( ) ( ) ( ) (8) { ( ) ( ) ( ) { ( ) ( ) (9) (10) { ( ) ( ) ( ) In fact, the probability of inversion of each vector component decreases, provided that its value coincides with the corresponding value of the known optimal solution, and increases otherwise. To calculate the new positions of each individual i, the components of the corresponding solution e are inverted with probabilities, for this value is compared with random values RND ie generated for each comparison. For vector the following normalizing condition is applied: Then the rule to determine derived positions will look as follows: (11) (12) { (13) The above-mentioned algorithm corresponds to that described previously described. Obviously, such a procedure will significantly reduce the probability of new solutions appearing in the population after a certain number of steps, i.e. the algorithm will be "stuck" at the point of the local extremum found. To overcome the problem of local extremums, it is proposed to introduce a procedure to randomize the positions, based on the criterion of "swarm density". When density refers to the generalized assessment of position deviation of each individual from, ( the function that restores the Hamming distance between the binary vectors a and b, the swarm density will be estimated as ( ( ) ) (14) where k the length of the solution binary vector, d number of individuals in the population. The range of values of corresponds to the interval {0... 1}, with a value of one indicating that the current positions of all individuals coincide with the best known editor@iaeme.com
8 Particle Swarm Optimization for Multidimensional Clustering of Natural Language Data solution found by the algorithm. The value is estimated at the end of each iteration, if the predetermined density threshold is exceeded, it is proposed to randomize the positions of a certain percentage of individuals and the corresponding acceleration vectors,, while preserving information about their best local solutions. This approach allows to automatically derive a numerical procedure from local extremums without losing the general search direction defined in the optimization process. Lower threshold values for will lead to a less intensive search for a solution in the area of the current extremum, and vice versa. 7. EVALUATION OF EFFICIENCY UPON CLUSTERING OF NATURAL LANGUAGE DATA The proposed concept was tested on natural language data on air incidents taken from the open base of the "Aviation safety network" [8]. The initial data contained descriptions of the incidents in English and the categorical variables associated with these incidents (damage level, vessel type, flight phase, etc.). Incident descriptions were parameterized using word2vec technology [9]. For each word included in the description, the corresponding vector was saved from the freely distributed dictionary, learned from news aggregator Google News text data. Each observation was then associated with a 300-dimensional numerical vector obtained by calculating the arithmetic mean values of the component sums for the word vectors making up this description. These vectors were considered as integral estimates of the description semantics that do not have an explicit interpretation in the context of the specified categorical variables. To test the proposed algorithm, a computational experiment was conducted, the purpose of which was to reduce the dimension of multidimensional vector descriptions, maximizing their discriminating force with respect to the level of damage resulting from the incident. The following levels of damage values were considered: Serious the aircraft was significantly damaged as a result of the incident; Minor the aircraft suffered minor damage as a result of the incident; None the aircraft was not damaged as a result of the incident; Missing as a result of the incident, the aircraft was completely lost, its fate is unknown. The training sample consisted of 600 observations whereby 300 were used as a training sample and 300 as a control sample. Division was performed for 4, 8, and 12 clusters, using k-mean clustering and self-organizing Kohonen feature maps as clustering algorithms when calculating the quality functional. The results of this study are graphically presented in table editor@iaeme.com
9 G.A. Yuryev, E.K. Verkhovskaya and N.E. Yuryeva Table 1 Visualization of the purity of cluster structures obtained by reducing the dimensionality of text descriptions, using 3 damage levels (3 types) and 4 damage levels (4 types) using k-means and self-organizing Kohonen feature maps. k-mean (3 types) SOM (3 types) k-mean (4 types) SOM (4 types) In the clustering results, it is noticeable that for the categorical variable values (damage level) obtained using 4 levels, cases with minor damages (minor, blue sector) and with serious damages (serious, red sector) are regularly combined into one cluster. In fact, these descriptions are quite complete, using the non-linear reduction method in dimensionality to visualize the location of multidimensional (300 component) observation points in the 3- dimensional space - t-sne shows that the points with the corresponding levels of damage are weakly distinguishable (Fig. 6). Figure 6 displays the distribution of Minor and Serious observations in the 3-dimensional space When aggregating Minor and Serious categories into one Damaged class (Table 1, columns 1 and 2), the separation result improves significantly. In terms of class definition editor@iaeme.com
10 Particle Swarm Optimization for Multidimensional Clustering of Natural Language Data error in the control sample, the error amounts to ~ 12% of errors when partitioning into 4 clusters and ~ 8% of errors when partitioning into 6 and 8 clusters. The results weakly depend on the chosen clustering method, this conclusion may be specific for this particular task. The dimensionality of the resulting feature space in each of the cases presented in Table 1 was formed from one third to one tenth of the original number of components. 8. CONCLUSIONS A new method was developed and tested for dimensionality reduction of data, which provides solutions that are quasi-optimal from the point of view of discrimination of the given classes. The method can be used in combination with text parameterization technology to process natural language records in arbitrary application areas. 1. The result of the proposed algorithm is not only a combination of the initial features, but also the coordinates of the cluster centers that combine observations in the space found (or the trained Kohonen network if it is chosen as a clustering method). 2. The proposed method does not require preliminary assumptions regarding the type of initial distribution of the observed features. 3. The described reduction procedure was prototyped, thus confirming its practical applicability. 4. The efficiency of the proposed technology was evaluated using examples of tasks with real source space. The method can be extended to any initial spaces in which points can be clustered using the k-means clustering method. 5. A multicomponent quality functional was formulated that allows to control the process of dimensionality reduction in the feature space and to form various characteristics of the resultant space. 6. For combinatorial optimization using the "particle swarm" method, a criterion to "jam" the algorithm in the local extremum region was proposed. A procedure was described to derive the algorithm from this domain and performed on the basis of the criterion test results. ACKNOWLEDGEMENTS "This work was financially supported by the Ministry of Education and Science of the Russian Federation within the framework of the Subsidy Agreement dating September 26, 2017 No (Unique identifier of the agreement RFMEFI57617X0092) for the implementation of applied scientific research on the topic: "Development of a neural network forecasting system for aviation incidents and safety risk management based on historical data including many parameters and text descriptions of events". REFERENCES [1] Narayana, S. Cluster Purity Visualizer. [2] Kuravsky, L. S., Marmalyuk, P. A., Yuryev, G. A., and Dumin, P. N. A Numerical Technique for the Identification of Discrete-State Continuous-Time Markov Models. Applied Mathematical Sciences, 9(8), 2015, pp editor@iaeme.com
11 G.A. Yuryev, E.K. Verkhovskaya and N.E. Yuryeva [3] Kuravsky, L. S., Marmalyuk, P. A., Yuryev, G. A., Belyaeva, O. B., and Prokopieva, O. Yu. Mathematical Foundations of Flight Crew Diagnostics Based on Videooculography Data. Applied Mathematical Sciences. 10(30), 2016, pp [4] Kennedy, J., and Eberhart, R. Swarm Intelligence. Morgan Kaufmann Publishers, Inc., San Francisco, CA, [5] Kennedy, J., and Eberhart, R. Particle Swarm Optimization, IEEE International Conference on Neural Networks (Perth, Australia), IEEE Service Center, Piscataway, NJ, IV, [6] Eberhart, R., and Kennedy, J. A New Optimizer Using Particles Swarm Theory, Proc. Sixth International Symposium on MicroMachine and Human Science (Nagoya, Japan), IEEE Service Center, Piscataway, NJ, [7] Khanesar, M. A., Tavakoli, H., Teshnehlab, M., and Shoorehdeli, M. A. Novel Binary Particle Swarm Optimization, Particle Swarm Optimization, Aleksandar Lazinica (Ed.), InTech, swarm_optimization [8] Aviation safety network [9] Mikolov, T., Yih, W., and Zweig, G. Linguistic Regularities in Continuous Space Word Representations. Proceedings of NAACL HLT, editor@iaeme.com
Particle Swarm Optimization
Particle Swarm Optimization Gonçalo Pereira INESC-ID and Instituto Superior Técnico Porto Salvo, Portugal gpereira@gaips.inesc-id.pt April 15, 2011 1 What is it? Particle Swarm Optimization is an algorithm
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem
More informationFeature weighting using particle swarm optimization for learning vector quantization classifier
Journal of Physics: Conference Series PAPER OPEN ACCESS Feature weighting using particle swarm optimization for learning vector quantization classifier To cite this article: A Dongoran et al 2018 J. Phys.:
More informationWe are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors
We are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists 4,100 116,000 120M Open access books available International authors and editors Downloads Our
More informationTracking Changing Extrema with Particle Swarm Optimizer
Tracking Changing Extrema with Particle Swarm Optimizer Anthony Carlisle Department of Mathematical and Computer Sciences, Huntingdon College antho@huntingdon.edu Abstract The modification of the Particle
More informationNUMERICAL METHODS PERFORMANCE OPTIMIZATION IN ELECTROLYTES PROPERTIES MODELING
NUMERICAL METHODS PERFORMANCE OPTIMIZATION IN ELECTROLYTES PROPERTIES MODELING Dmitry Potapov National Research Nuclear University MEPHI, Russia, Moscow, Kashirskoe Highway, The European Laboratory for
More informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationResearch on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a
International Conference on Education Technology, Management and Humanities Science (ETMHS 2015) Research on Applications of Data Mining in Electronic Commerce Xiuping YANG 1, a 1 Computer Science Department,
More informationCHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES
CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES 6.1 INTRODUCTION The exploration of applications of ANN for image classification has yielded satisfactory results. But, the scope for improving
More informationAn improved PID neural network controller for long time delay systems using particle swarm optimization algorithm
An improved PID neural network controller for long time delay systems using particle swarm optimization algorithm A. Lari, A. Khosravi and A. Alfi Faculty of Electrical and Computer Engineering, Noushirvani
More informationComparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems
Australian Journal of Basic and Applied Sciences, 4(8): 3366-3382, 21 ISSN 1991-8178 Comparison of Some Evolutionary Algorithms for Approximate Solutions of Optimal Control Problems Akbar H. Borzabadi,
More informationA NEW APPROACH TO SOLVE ECONOMIC LOAD DISPATCH USING PARTICLE SWARM OPTIMIZATION
A NEW APPROACH TO SOLVE ECONOMIC LOAD DISPATCH USING PARTICLE SWARM OPTIMIZATION Manjeet Singh 1, Divesh Thareja 2 1 Department of Electrical and Electronics Engineering, Assistant Professor, HCTM Technical
More informationSWITCHES ALLOCATION IN DISTRIBUTION NETWORK USING PARTICLE SWARM OPTIMIZATION BASED ON FUZZY EXPERT SYSTEM
SWITCHES ALLOCATION IN DISTRIBUTION NETWORK USING PARTICLE SWARM OPTIMIZATION BASED ON FUZZY EXPERT SYSTEM Tiago Alencar UFMA tiagoalen@gmail.com Anselmo Rodrigues UFMA schaum.nyquist@gmail.com Maria da
More informationAdvances in Military Technology Vol. 11, No. 1, June Influence of State Space Topology on Parameter Identification Based on PSO Method
AiMT Advances in Military Technology Vol. 11, No. 1, June 16 Influence of State Space Topology on Parameter Identification Based on PSO Method M. Dub 1* and A. Štefek 1 Department of Aircraft Electrical
More informationUnsupervised Learning
Unsupervised Learning Unsupervised learning Until now, we have assumed our training samples are labeled by their category membership. Methods that use labeled samples are said to be supervised. However,
More informationModified Particle Swarm Optimization
Modified Particle Swarm Optimization Swati Agrawal 1, R.P. Shimpi 2 1 Aerospace Engineering Department, IIT Bombay, Mumbai, India, swati.agrawal@iitb.ac.in 2 Aerospace Engineering Department, IIT Bombay,
More informationArgha Roy* Dept. of CSE Netaji Subhash Engg. College West Bengal, India.
Volume 3, Issue 3, March 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Training Artificial
More informationSeismic regionalization based on an artificial neural network
Seismic regionalization based on an artificial neural network *Jaime García-Pérez 1) and René Riaño 2) 1), 2) Instituto de Ingeniería, UNAM, CU, Coyoacán, México D.F., 014510, Mexico 1) jgap@pumas.ii.unam.mx
More informationARMA MODEL SELECTION USING PARTICLE SWARM OPTIMIZATION AND AIC CRITERIA. Mark S. Voss a b. and Xin Feng.
Copyright 2002 IFAC 5th Triennial World Congress, Barcelona, Spain ARMA MODEL SELECTION USING PARTICLE SWARM OPTIMIZATION AND AIC CRITERIA Mark S. Voss a b and Xin Feng a Department of Civil and Environmental
More informationCHAPTER 5 OPTIMAL CLUSTER-BASED RETRIEVAL
85 CHAPTER 5 OPTIMAL CLUSTER-BASED RETRIEVAL 5.1 INTRODUCTION Document clustering can be applied to improve the retrieval process. Fast and high quality document clustering algorithms play an important
More informationHandling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization
Handling Multi Objectives of with Multi Objective Dynamic Particle Swarm Optimization Richa Agnihotri #1, Dr. Shikha Agrawal #1, Dr. Rajeev Pandey #1 # Department of Computer Science Engineering, UIT,
More informationParticle Swarm Optimization applied to Pattern Recognition
Particle Swarm Optimization applied to Pattern Recognition by Abel Mengistu Advisor: Dr. Raheel Ahmad CS Senior Research 2011 Manchester College May, 2011-1 - Table of Contents Introduction... - 3 - Objectives...
More informationResearch Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
More information9.1. K-means Clustering
424 9. MIXTURE MODELS AND EM Section 9.2 Section 9.3 Section 9.4 view of mixture distributions in which the discrete latent variables can be interpreted as defining assignments of data points to specific
More informationA MULTI-SWARM PARTICLE SWARM OPTIMIZATION WITH LOCAL SEARCH ON MULTI-ROBOT SEARCH SYSTEM
A MULTI-SWARM PARTICLE SWARM OPTIMIZATION WITH LOCAL SEARCH ON MULTI-ROBOT SEARCH SYSTEM BAHAREH NAKISA, MOHAMMAD NAIM RASTGOO, MOHAMMAD FAIDZUL NASRUDIN, MOHD ZAKREE AHMAD NAZRI Department of Computer
More informationA Numerical Technique for the Identification of. Discrete-State Continuous-Time Markov Models
Applied Mathematical Sciences, Vol. 9, 2015, no. 8, 379-391 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.410882 A Numerical Technique for the Identification of Discrete-State Continuous-Time
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationA *69>H>N6 #DJGC6A DG C<>C::G>C<,8>:C8:H /DA 'D 2:6G, ()-"&"3 -"(' ( +-" " " % '.+ % ' -0(+$,
The structure is a very important aspect in neural network design, it is not only impossible to determine an optimal structure for a given problem, it is even impossible to prove that a given structure
More informationOptimized Algorithm for Particle Swarm Optimization
Optimized Algorithm for Particle Swarm Optimization Fuzhang Zhao Abstract Particle swarm optimization (PSO) is becoming one of the most important swarm intelligent paradigms for solving global optimization
More informationUsing Cluster Analysis in the Synthesis of Electrical Equipment Diagnostic Models
Using Cluster Analysis in the Synthesis of Electrical Equipment Diagnostic Models Ksenia Gnutova, Denis Eltyshev Electrotechnical Department, Perm National Research Polytechnic University, Komsomolsky
More informationLECTURE 16: SWARM INTELLIGENCE 2 / PARTICLE SWARM OPTIMIZATION 2
15-382 COLLECTIVE INTELLIGENCE - S18 LECTURE 16: SWARM INTELLIGENCE 2 / PARTICLE SWARM OPTIMIZATION 2 INSTRUCTOR: GIANNI A. DI CARO BACKGROUND: REYNOLDS BOIDS Reynolds created a model of coordinated animal
More informationAPPLICATION OF BPSO IN FLEXIBLE MANUFACTURING SYSTEM SCHEDULING
International Journal of Mechanical Engineering and Technology (IJMET) Volume 8, Issue 5, May 2017, pp. 186 195, Article ID: IJMET_08_05_020 Available online at http://www.ia aeme.com/ijmet/issues.asp?jtype=ijmet&vtyp
More informationTHE VARIABILITY OF FUZZY AGGREGATION METHODS FOR PARTIAL INDICATORS OF QUALITY AND THE OPTIMAL METHOD CHOICE
THE VARIABILITY OF FUZZY AGGREGATION METHODS FOR PARTIAL INDICATORS OF QUALITY AND THE OPTIMAL METHOD CHOICE Mikhail V. Koroteev 1, Pavel V. Tereliansky 1, Oleg I. Vasilyev 2, Abduvap M. Zulpuyev 3, Kadanbay
More informationExperimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization
Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization adfa, p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011 Devang Agarwal and Deepak Sharma Department of Mechanical
More informationParticle Swarm Optimization Based Approach for Location Area Planning in Cellular Networks
International Journal of Intelligent Systems and Applications in Engineering Advanced Technology and Science ISSN:2147-67992147-6799 www.atscience.org/ijisae Original Research Paper Particle Swarm Optimization
More informationPARTICLE SWARM OPTIMIZATION (PSO)
PARTICLE SWARM OPTIMIZATION (PSO) J. Kennedy and R. Eberhart, Particle Swarm Optimization. Proceedings of the Fourth IEEE Int. Conference on Neural Networks, 1995. A population based optimization technique
More informationKeywords: clustering algorithms, unsupervised learning, cluster validity
Volume 6, Issue 1, January 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Clustering Based
More informationImproving Tree-Based Classification Rules Using a Particle Swarm Optimization
Improving Tree-Based Classification Rules Using a Particle Swarm Optimization Chi-Hyuck Jun *, Yun-Ju Cho, and Hyeseon Lee Department of Industrial and Management Engineering Pohang University of Science
More informationA Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem
0 IEEE Congress on Evolutionary Computation (CEC) July -, 0, Beijing, China A Combinatorial Algorithm for The Cardinality Constrained Portfolio Optimization Problem Tianxiang Cui, Shi Cheng, and Ruibin
More informationCell-to-switch assignment in. cellular networks. barebones particle swarm optimization
Cell-to-switch assignment in cellular networks using barebones particle swarm optimization Sotirios K. Goudos a), Konstantinos B. Baltzis, Christos Bachtsevanidis, and John N. Sahalos RadioCommunications
More informationRanking of nodes of networks taking into account the power function of its weight of connections
Ranking of nodes of networks taking into account the power function of its weight of connections Soboliev A.M. 1, Lande D.V. 2 1 Post-graduate student of the Institute for Special Communications and Information
More informationMAXIMUM LIKELIHOOD ESTIMATION USING ACCELERATED GENETIC ALGORITHMS
In: Journal of Applied Statistical Science Volume 18, Number 3, pp. 1 7 ISSN: 1067-5817 c 2011 Nova Science Publishers, Inc. MAXIMUM LIKELIHOOD ESTIMATION USING ACCELERATED GENETIC ALGORITHMS Füsun Akman
More informationTERNARY TREES USAGE FOR COMPUTATIONAL EXPERIMENT DATA STORAGE
TERNARY TREES USAGE FOR COMPUTATIONAL EXPERIMENT DATA STORAGE A.N. Kovartsev 1, D.A. Popova-Kovartseva 1, E.E. Gorshkova 1 1 Samara National Research University, Samara, Russia Abstract. Repository for
More informationReconfiguration Optimization for Loss Reduction in Distribution Networks using Hybrid PSO algorithm and Fuzzy logic
Bulletin of Environment, Pharmacology and Life Sciences Bull. Env. Pharmacol. Life Sci., Vol 4 [9] August 2015: 115-120 2015 Academy for Environment and Life Sciences, India Online ISSN 2277-1808 Journal
More informationMobile Robot Path Planning in Static Environments using Particle Swarm Optimization
Mobile Robot Path Planning in Static Environments using Particle Swarm Optimization M. Shahab Alam, M. Usman Rafique, and M. Umer Khan Abstract Motion planning is a key element of robotics since it empowers
More informationIntroduction to Trajectory Clustering. By YONGLI ZHANG
Introduction to Trajectory Clustering By YONGLI ZHANG Outline 1. Problem Definition 2. Clustering Methods for Trajectory data 3. Model-based Trajectory Clustering 4. Applications 5. Conclusions 1 Problem
More informationParticle swarm optimization for mobile network design
Particle swarm optimization for mobile network design Ayman A. El-Saleh 1,2a), Mahamod Ismail 1, R. Viknesh 2, C. C. Mark 2, and M. L. Chan 2 1 Department of Electrical, Electronics, and Systems Engineering,
More informationPowered Outer Probabilistic Clustering
Proceedings of the World Congress on Engineering and Computer Science 217 Vol I WCECS 217, October 2-27, 217, San Francisco, USA Powered Outer Probabilistic Clustering Peter Taraba Abstract Clustering
More informationMachine Learning : Clustering, Self-Organizing Maps
Machine Learning Clustering, Self-Organizing Maps 12/12/2013 Machine Learning : Clustering, Self-Organizing Maps Clustering The task: partition a set of objects into meaningful subsets (clusters). The
More informationIMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE
IMPROVING THE PARTICLE SWARM OPTIMIZATION ALGORITHM USING THE SIMPLEX METHOD AT LATE STAGE Fang Wang, and Yuhui Qiu Intelligent Software and Software Engineering Laboratory, Southwest-China Normal University,
More informationThree-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization
Three-Dimensional Off-Line Path Planning for Unmanned Aerial Vehicle Using Modified Particle Swarm Optimization Lana Dalawr Jalal Abstract This paper addresses the problem of offline path planning for
More informationOPTIMIZED TASK ALLOCATION IN SENSOR NETWORKS
OPTIMIZED TASK ALLOCATION IN SENSOR NETWORKS Ali Bagherinia 1 1 Department of Computer Engineering, Islamic Azad University-Dehdasht Branch, Dehdasht, Iran ali.bagherinia@gmail.com ABSTRACT In this paper
More informationUsing Machine Learning to Optimize Storage Systems
Using Machine Learning to Optimize Storage Systems Dr. Kiran Gunnam 1 Outline 1. Overview 2. Building Flash Models using Logistic Regression. 3. Storage Object classification 4. Storage Allocation recommendation
More informationHEURISTIC OPTIMIZATION USING COMPUTER SIMULATION: A STUDY OF STAFFING LEVELS IN A PHARMACEUTICAL MANUFACTURING LABORATORY
Proceedings of the 1998 Winter Simulation Conference D.J. Medeiros, E.F. Watson, J.S. Carson and M.S. Manivannan, eds. HEURISTIC OPTIMIZATION USING COMPUTER SIMULATION: A STUDY OF STAFFING LEVELS IN A
More informationToward Part-based Document Image Decoding
2012 10th IAPR International Workshop on Document Analysis Systems Toward Part-based Document Image Decoding Wang Song, Seiichi Uchida Kyushu University, Fukuoka, Japan wangsong@human.ait.kyushu-u.ac.jp,
More informationDEVELOPMENT OF THE EFFECTIVE SET OF FEATURES CONSTRUCTION TECHNOLOGY FOR TEXTURE IMAGE CLASSES DISCRIMINATION
DEVELOPMENT OF THE EFFECTIVE SET OF FEATURES CONSTRUCTION TECHNOLOGY FOR TEXTURE IMAGE CLASSES DISCRIMINATION E. Biryukova 1, R. Paringer 1,2, A.V. Kupriyanov 1,2 1 Samara National Research University,
More informationCHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION
CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION 6.1 INTRODUCTION Fuzzy logic based computational techniques are becoming increasingly important in the medical image analysis arena. The significant
More informationModule 1 Lecture Notes 2. Optimization Problem and Model Formulation
Optimization Methods: Introduction and Basic concepts 1 Module 1 Lecture Notes 2 Optimization Problem and Model Formulation Introduction In the previous lecture we studied the evolution of optimization
More informationCluster Analysis. Mu-Chun Su. Department of Computer Science and Information Engineering National Central University 2003/3/11 1
Cluster Analysis Mu-Chun Su Department of Computer Science and Information Engineering National Central University 2003/3/11 1 Introduction Cluster analysis is the formal study of algorithms and methods
More informationPattern Recognition. Kjell Elenius. Speech, Music and Hearing KTH. March 29, 2007 Speech recognition
Pattern Recognition Kjell Elenius Speech, Music and Hearing KTH March 29, 2007 Speech recognition 2007 1 Ch 4. Pattern Recognition 1(3) Bayes Decision Theory Minimum-Error-Rate Decision Rules Discriminant
More informationCONTROL ALLOCATION FOR AIRSHIPS
International Journal of Civil Engineering and Technology (IJCIET) Volume 9, Issue 3, March 2018, pp. 887 895, Article ID: IJCIET_09_03_088 Available online at http://www.iaeme.com/ijciet/issues.asp?jtype=ijciet&vtype=9&itype=3
More informationConstraints in Particle Swarm Optimization of Hidden Markov Models
Constraints in Particle Swarm Optimization of Hidden Markov Models Martin Macaš, Daniel Novák, and Lenka Lhotská Czech Technical University, Faculty of Electrical Engineering, Dep. of Cybernetics, Prague,
More informationEffects of Weight Approximation Methods on Performance of Digital Beamforming Using Least Mean Squares Algorithm
IOSR Journal of Electrical and Electronics Engineering (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331,Volume 6, Issue 3 (May. - Jun. 2013), PP 82-90 Effects of Weight Approximation Methods on Performance
More informationUnsupervised Learning and Clustering
Unsupervised Learning and Clustering Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Spring 2009 CS 551, Spring 2009 c 2009, Selim Aksoy (Bilkent University)
More informationComparing Classification Performances between Neural Networks and Particle Swarm Optimization for Traffic Sign Recognition
Comparing Classification Performances between Neural Networks and Particle Swarm Optimization for Traffic Sign Recognition THONGCHAI SURINWARANGKOON, SUPOT NITSUWAT, ELVIN J. MOORE Department of Information
More informationWhat Makes A Successful Society?
What Makes A Successful Society? Experiments With Population Topologies in Particle Swarms Rui Mendes and José Neves Departamento de Informática Universidade do Minho Portugal Abstract. Previous studies
More informationKeywords Clustering, Goals of clustering, clustering techniques, clustering algorithms.
Volume 3, Issue 5, May 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Survey of Clustering
More informationYear 8 Review 1, Set 1 Number confidence (Four operations, place value, common indices and estimation)
Year 8 Review 1, Set 1 Number confidence (Four operations, place value, common indices and estimation) Place value Digit Integer Negative number Difference, Minus, Less Operation Multiply, Multiplication,
More informationData Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University
Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Search & Optimization Search and Optimization method deals with
More informationA Data Classification Algorithm of Internet of Things Based on Neural Network
A Data Classification Algorithm of Internet of Things Based on Neural Network https://doi.org/10.3991/ijoe.v13i09.7587 Zhenjun Li Hunan Radio and TV University, Hunan, China 278060389@qq.com Abstract To
More informationA Population Based Convergence Criterion for Self-Organizing Maps
A Population Based Convergence Criterion for Self-Organizing Maps Lutz Hamel and Benjamin Ott Department of Computer Science and Statistics, University of Rhode Island, Kingston, RI 02881, USA. Email:
More informationSIMULTANEOUS COMPUTATION OF MODEL ORDER AND PARAMETER ESTIMATION FOR ARX MODEL BASED ON MULTI- SWARM PARTICLE SWARM OPTIMIZATION
SIMULTANEOUS COMPUTATION OF MODEL ORDER AND PARAMETER ESTIMATION FOR ARX MODEL BASED ON MULTI- SWARM PARTICLE SWARM OPTIMIZATION Kamil Zakwan Mohd Azmi, Zuwairie Ibrahim and Dwi Pebrianti Faculty of Electrical
More informationSome questions of consensus building using co-association
Some questions of consensus building using co-association VITALIY TAYANOV Polish-Japanese High School of Computer Technics Aleja Legionow, 4190, Bytom POLAND vtayanov@yahoo.com Abstract: In this paper
More informationTraffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization
Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization J.Venkatesh 1, B.Chiranjeevulu 2 1 PG Student, Dept. of ECE, Viswanadha Institute of Technology And Management,
More informationECLT 5810 Clustering
ECLT 5810 Clustering What is Cluster Analysis? Cluster: a collection of data objects Similar to one another within the same cluster Dissimilar to the objects in other clusters Cluster analysis Grouping
More informationAnalyzing Outlier Detection Techniques with Hybrid Method
Analyzing Outlier Detection Techniques with Hybrid Method Shruti Aggarwal Assistant Professor Department of Computer Science and Engineering Sri Guru Granth Sahib World University. (SGGSWU) Fatehgarh Sahib,
More informationFormal Model. Figure 1: The target concept T is a subset of the concept S = [0, 1]. The search agent needs to search S for a point in T.
Although this paper analyzes shaping with respect to its benefits on search problems, the reader should recognize that shaping is often intimately related to reinforcement learning. The objective in reinforcement
More informationMachine Learning for Signal Processing Clustering. Bhiksha Raj Class Oct 2016
Machine Learning for Signal Processing Clustering Bhiksha Raj Class 11. 13 Oct 2016 1 Statistical Modelling and Latent Structure Much of statistical modelling attempts to identify latent structure in the
More informationUnsupervised Learning : Clustering
Unsupervised Learning : Clustering Things to be Addressed Traditional Learning Models. Cluster Analysis K-means Clustering Algorithm Drawbacks of traditional clustering algorithms. Clustering as a complex
More informationAn Approach to Polygonal Approximation of Digital CurvesBasedonDiscreteParticleSwarmAlgorithm
Journal of Universal Computer Science, vol. 13, no. 10 (2007), 1449-1461 submitted: 12/6/06, accepted: 24/10/06, appeared: 28/10/07 J.UCS An Approach to Polygonal Approximation of Digital CurvesBasedonDiscreteParticleSwarmAlgorithm
More informationAutomatic differentiation based for particle swarm optimization steepest descent direction
International Journal of Advances in Intelligent Informatics ISSN: 2442-6571 Vol 1, No 2, July 2015, pp. 90-97 90 Automatic differentiation based for particle swarm optimization steepest descent direction
More informationOPTIMUM CAPACITY ALLOCATION OF DISTRIBUTED GENERATION UNITS USING PARALLEL PSO USING MESSAGE PASSING INTERFACE
OPTIMUM CAPACITY ALLOCATION OF DISTRIBUTED GENERATION UNITS USING PARALLEL PSO USING MESSAGE PASSING INTERFACE Rosamma Thomas 1, Jino M Pattery 2, Surumi Hassainar 3 1 M.Tech Student, Electrical and Electronics,
More informationNeural Networks. CE-725: Statistical Pattern Recognition Sharif University of Technology Spring Soleymani
Neural Networks CE-725: Statistical Pattern Recognition Sharif University of Technology Spring 2013 Soleymani Outline Biological and artificial neural networks Feed-forward neural networks Single layer
More informationTHE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS. Alekseí Yu. Chekunov. 1. Introduction
MATEMATIQKI VESNIK Corrected proof Available online 01.10.2016 originalni nauqni rad research paper THE COMPUTER MODELLING OF GLUING FLAT IMAGES ALGORITHMS Alekseí Yu. Chekunov Abstract. In this paper
More informationA Review on Cluster Based Approach in Data Mining
A Review on Cluster Based Approach in Data Mining M. Vijaya Maheswari PhD Research Scholar, Department of Computer Science Karpagam University Coimbatore, Tamilnadu,India Dr T. Christopher Assistant professor,
More informationQUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION
International Journal of Computer Engineering and Applications, Volume VIII, Issue I, Part I, October 14 QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION Shradha Chawla 1, Vivek Panwar 2 1 Department
More informationDynamic Clustering of Data with Modified K-Means Algorithm
2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Dynamic Clustering of Data with Modified K-Means Algorithm Ahamed Shafeeq
More informationChapter DM:II. II. Cluster Analysis
Chapter DM:II II. Cluster Analysis Cluster Analysis Basics Hierarchical Cluster Analysis Iterative Cluster Analysis Density-Based Cluster Analysis Cluster Evaluation Constrained Cluster Analysis DM:II-1
More informationPSO-based Energy-balanced Double Cluster-heads Clustering Routing for wireless sensor networks
Available online at www.sciencedirect.com Procedia ngineering 15 (2011) 3073 3077 Advanced in Control ngineering and Information Science PSO-based nergy-balanced Double Cluster-heads Clustering Routing
More informationArtificial bee colony algorithm with multiple onlookers for constrained optimization problems
Artificial bee colony algorithm with multiple onlookers for constrained optimization problems Milos Subotic Faculty of Computer Science University Megatrend Belgrade Bulevar umetnosti 29 SERBIA milos.subotic@gmail.com
More informationAN APPROACH FOR LOAD BALANCING FOR SIMULATION IN HETEROGENEOUS DISTRIBUTED SYSTEMS USING SIMULATION DATA MINING
AN APPROACH FOR LOAD BALANCING FOR SIMULATION IN HETEROGENEOUS DISTRIBUTED SYSTEMS USING SIMULATION DATA MINING Irina Bernst, Patrick Bouillon, Jörg Frochte *, Christof Kaufmann Dept. of Electrical Engineering
More informationContextual priming for artificial visual perception
Contextual priming for artificial visual perception Hervé Guillaume 1, Nathalie Denquive 1, Philippe Tarroux 1,2 1 LIMSI-CNRS BP 133 F-91403 Orsay cedex France 2 ENS 45 rue d Ulm F-75230 Paris cedex 05
More informationApplication of Improved Discrete Particle Swarm Optimization in Logistics Distribution Routing Problem
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 3673 3677 Advanced in Control Engineeringand Information Science Application of Improved Discrete Particle Swarm Optimization in
More informationA Novel Field-source Reverse Transform for Image Structure Representation and Analysis
A Novel Field-source Reverse Transform for Image Structure Representation and Analysis X. D. ZHUANG 1,2 and N. E. MASTORAKIS 1,3 1. WSEAS Headquarters, Agiou Ioannou Theologou 17-23, 15773, Zografou, Athens,
More informationSolving the Hard Knapsack Problems with a Binary Particle Swarm Approach
Solving the Hard Knapsack Problems with a Binary Particle Swarm Approach Bin Ye 1, Jun Sun 1, and Wen-Bo Xu 1 School of Information Technology, Southern Yangtze University, No.1800, Lihu Dadao, Wuxi, Jiangsu
More informationApplMath Lucie Kárná; Štěpán Klapka Message doubling and error detection in the binary symmetrical channel.
ApplMath 2015 Lucie Kárná; Štěpán Klapka Message doubling and error detection in the binary symmetrical channel In: Jan Brandts and Sergej Korotov and Michal Křížek and Karel Segeth and Jakub Šístek and
More informationParticle Swarm Optimization Approach with Parameter-wise Hill-climbing Heuristic for Task Allocation of Workflow Applications on the Cloud
Particle Swarm Optimization Approach with Parameter-wise Hill-climbing Heuristic for Task Allocation of Workflow Applications on the Cloud Simone A. Ludwig Department of Computer Science North Dakota State
More informationGraph Matching: Fast Candidate Elimination Using Machine Learning Techniques
Graph Matching: Fast Candidate Elimination Using Machine Learning Techniques M. Lazarescu 1,2, H. Bunke 1, and S. Venkatesh 2 1 Computer Science Department, University of Bern, Switzerland 2 School of
More informationEfficient Voting Prediction for Pairwise Multilabel Classification
Efficient Voting Prediction for Pairwise Multilabel Classification Eneldo Loza Mencía, Sang-Hyeun Park and Johannes Fürnkranz TU-Darmstadt - Knowledge Engineering Group Hochschulstr. 10 - Darmstadt - Germany
More information