A Two-Stage Algorithm for Data Clustering
|
|
- Ethan Floyd
- 5 years ago
- Views:
Transcription
1 A Two-Stage Algorthm for Data Clusterng Abdolreza Hatamlou 1 and Salwan Abdullah 2 1 Islamc Azad Unversty, Khoy Branch, Iran 2 Data Mnng and Optmsaton Research Group, Center for Artfcal Intellgence Technology, Unverst Kebangsaan Malaysa, 436 Bang, Selangor, Malaysa Abstract - Cluster analyss s an mportant and popular data analyss technque that s used n a large varety of felds. K-means s a well-known and wdely used clusterng technque due to ts smplcty n mplementaton and hgh speed n most stuatons. However, t suffers from two major shortcomngs: t s very senstve to the ntal state of centrods and may converge to local optmum soluton. In order to overcome the shortcomngs of K-means, we present a two-stage approach, called KM-HS, whch s based on K-means and a heurstc search algorthm. At the frst stage of the proposed approach, K-means algorthm s appled to fnd an ntal soluton to the clusterng problem and then at the second stage, a heurstc search algorthm s used to mprove the qualty of the ntal soluton by searchng around t. The performance of the proposed algorthm s evaluated usng four benchmark datasets from UCI repostory. The expermental results ndcate that the KM-HS algorthm not only fnds hgh qualty clusters but also converges more quckly than other evolutonary algorthms. Keywords: Cluster Analyss; K-means; Heurstc Search Algorthm 1 Introducton Clusterng analyss parttons a set of objects nto subsets, as clusters, so that objects n the same cluster are smlar or related to each other, whle objects n dfferent clusters are dssmlar or unrelated [1, 2]. Clusterng analyss has been used n a large varety of felds and applcatons rangng from pattern recognton, web mnng, mage segmentaton, genetcs, mcrobology, geography, remote sensng, psychology, educaton, marketng and busness [3-8]. Clusterng algorthms are broadly based on two man approaches: herarchcal and parttonal [2]. Herarchcal algorthms can be dvded as agglomeratve (bottom-up) or dvsve (top-down) methods. Agglomeratve methods consder each object as a dstnct cluster and combne them sequentally n larger clusters. Dvsve methods start wth the all objects as a sngleton cluster and contnue to dvde t nto sequentally smaller clusters. Parttonal methods, on the other hand, attempt to dvde objects drectly nto a set of dsjont clusters, wthout makng a tree structure. They try to optmze an objectve functon. Typcally, the objectve functon nvolves n mnmzng the dssmlarty n the objects wthn each cluster, whle maxmzng the dssmlarty between objects n dfferent clusters. Among tradtonal clusterng algorthms, K-means s the most popular and wdely used method due to ts smplcty and computatonal effcency, wth lnear tme complexty [9]. However, t s very senstve to the ntal choce of centrods and may converge to local mnma [1]. Recently, to overcome the drawbacks of K-means algorthm, many clusterng technques based on evolutonary algorthms such as genetc algorthm (GA), tabu search (TS), smulated annealng (SA), honey bee matng optmzaton (HBMO), ant colony optmzaton (ACO) and partcle swarm optmzaton (PSO) have been proposed [11-16]. However, most of evolutonary methods are typcally very slow to fnd optmal soluton. In order to overcome the above mentoned shortcomngs, we present a novel clusterng algorthm whch combnes K-means and a heurstc search algorthm, called KM-HS. In partcular, we use K- means algorthm to fnd an ntal soluton for the clusterng problem. Afterward, we use a heurstc search algorthm to thoroughly explore around of the
2 ntal soluton so that KM-HS mght fnd global optmum. The rest of ths paper s organzed as follows. Secton 2 explans the basc prncples of cluster analyss and K- means algorthm, whle the proposed KM-HS algorthm s explaned n secton 3. Secton 4 presents expermental results usng four standard benchmark datasets. Fnally, concluson of ths work s drawn n secton 5. 2 Cluster analyss Clusterng s the process of parttonng a set of objects nto a fnte number of k clusters so that the objects wthn each cluster are smlar, whle objects n dfferent clusters are dssmlar. In most of clusterng algorthms, the crteron that s used to measure the qualty of resultng clusters s defned as n Eq.(1), whch s known as mnmzng sum of squared error [17]. f (O,C) = k l 1O Cl 2 d ( O, Z ) (1) where d( O, Z l ) specfes the dstance between object O and the cluster centrod Z l. Usually, smlarty and dssmlarty between objects are expressed through some dstance functons. The most common dstance functon s the Eucldean dstance that s defned as follows: d( O, O ) j d p 1 ( o p l o where d(o, O j ) specfes the dstance between two objects O and O j. P s the dmensonalty of the dataset. As mentoned earler, K-means s the most popular and wdely used clusterng algorthm. K-means starts wth k ntal centrods (these centrods are created randomly or derved from some heurstc approaches). Each object n the dataset s then assgned to the closest centrod. Centrods are updated by usng the mean of the objects wthn each cluster. Ths process s repeated untl a termnaton crteron s met. 3 Proposed approach The proposed approach s bult based on two man stages. At the frst stage, the K-means algorthm s appled to fnd an ntal soluton to the clusterng problem. K-means algorthm can do ths effcently, whle t s very fast. However the output of K-means possbly s far from optmal soluton and t can be mproved by some other technques. To ensure to get a p j ) 2 (2) good soluton by the K-means algorthm n the frst stage of the proposed algorthm, K-means s conducted 3 tmes and the best soluton among them wll be passed to the next stage for further mprovement. At the second stage, we have appled a heurstc search method to search around the ntal soluton found by the k-means algorthm at the frst stage. The proposed approach wll try to mprove the qualty of the ntal soluton (output of the frst stage) by searchng around t n all dmensons. The structure of the proposed heurstc search s as follows: At the frst, an ntal value wll be consdered as the ntal step of movement for the algorthm. Ths value wll be added to all features n the ntal soluton one by one. In other words, the threshold wll be added to the frst feature n the frst centrod and then the ftness value of the new produced centrod wll be calculated and compared wth the ftness value of the current centrod. If there s an mprovement n terms of ftness value, then the current centrod wll be replaced by the new centrod. Otherwse, the current centrod wll be reloaded and the search drecton changes to the other sde for the respectve feature. Whch means that, at the next teraton, the threshold value wll be subtracted from the current value of the respectve feature, and the above procedure wll be done agan. If there s no mprovement n both sdes of the consdered feature n the consdered centrod usng the current threshold, the threshold value of the respectve feature wll be dvded by two for the next teraton. Ths causes the heurstc search to act n a bnary way and the tme complexty of ths stage to be logarthmc. The above mentoned procedure wll be repeated for all features of the consdered centrod, and then for the other centrods sequentally untl the termnaton crtera are satsfed. Based on the above descrpton, the pseudo code of the KM-HS s stated as follows: Stage 1: K-means method 1.1. Select k ponts as the ntal centrods n a random way (Re)Assgn all objects to the closest centrod Recalculate the centrod of each cluster Repeat steps 1.2 and 1.3 untl a termnaton crteron s met Pass the soluton to the next stage. Stage 2: Heurstc search For all centrods =1...k do For all features j=1...d do If SD (j)==1 C(j)= C(j)+SS(j); Calculate ftness value for the new centrod. If the ftness value has been mproved Make the new centrod permanent
3 Else Reload the old centrod SD (j)=-1 Else f SD (j)==-1 C(j)= C(j)-SS(j) Calculate ftness value for the new centrod. If the ftness value has been mproved Make the new centrod permanent Else Reload the old centrod SD (j)= Else f SD (j)== SS(j)= SS(j)/2; SD (j)=1; End for End for In the above pseudo code, SD= [SD 1, SD 2,..., SD k ] s the search drecton, and SS= [SS 1, SS 2,..., SS k ] s the search step, where SD s the search drecton of the -th centrod and the length of ths array s d, whch s the dmensonalty of the test dataset. All felds n ths array are ntalzed to 1 at the begnnng, and change to -1, and 1 durng the search process. SS s the search step for the -th centrod, and t wll be set to Max(dataset) at the begnnng. Max(dataset) s an 1-dmenson array wth length of d, where each member of t contans the maxmum value of the correspondng feld n the test dataset. C=[C 1, C 2,, C k ] contans the centrods of k clusters and C (j) specfes the j-th feature n the -th cluster. To explan how the proposed heurstc search algorthm works, magne that the snapshot of the system s lke the Fg 1(a). For smplcty, we have consdered only one centrod n ths example wth four features. As seen from the Fg 1(a) at the end of the current teraton a new centrod s produced usng the current centrod, current search drecton and current search step. Improvement has happened on the frst and second features, whereas the thrd and forth features have not been changed. So, at the next teraton, search process wll contnue n the current drecton for the features 1 and 2. For the 3 rd feature, the search drecton s, meanng that, no mprovement happened for ths feature n both drectons n the prevous teratons. So, for the next teraton, the search step wll be dvded by 2 and search drecton wll be set to 1. For the last feature, the search drecton wll be set to -1.e. to search for a better soluton n the opposte drecton as there s no room for mprovement n the current drecton so, the system stuaton for the next teraton wll be lke as Fg 1(b). Current Centrod SD SS New Centrod Fnal Centrod (a) Current Centrod SD SS New Centrod Fnal Centrod???? (b) Fgure 1. An example for explanng the proposed heurstc search method 4 Expermental results Four benchmark datasets are used to assess the performance of the proposed approach, KM-HS, n comparson wth K-means [9], tabu search (TS) [11], partcle swarm optmzaton (PSO) [12], genetc algorthm (GA) [13], honey bee matng optmzaton (HBMO) [14], smulated annealng (SA) [15] and ant colony optmzaton (ACO) [16]. The used datasets are Irs, Wne, Contraceptve Method Choce (CMC) and Wsconsn Breast Cancer that are provded by UCI repostory of machne learnng databases [18]. Datasets have the followng characterstcs: Irs dataset (n=15, d=4, k=3): Ths dataset was collected by Anderson (1935). It contans three classes of 5 objects each, where each class refers to a type of rs flower. There are 15 random samples of rs flowers wth four numerc attrbutes n ths dataset. These attrbutes are sepal length and wdth n cm, petal length and wdth n cm. There s no mssng value for attrbutes. Wne dataset (n=178, d=13, k=3): Ths dataset contans the results of a chemcal analyss of wnes grown n the same regon n Italy but derved from three dfferent cultvars. Ths dataset contans 178 nstances wth 13 contnuous numerc attrbutes. There s no mssng attrbute value. Contraceptve Method Choce also denoted as CMC (n = 1473, d = 9, k = 3): Ths dataset s a subset of the 1987 Natonal Indonesa Contraceptve Prevalence Survey. The samples are marred women who ether
4 Table 1 The results for dfferent clusterng algorthms Dataset Crtera K-means GA SA TS ACO HBMO PSO KM-HS Irs Wne CMC Cancer , were not pregnant or dd not know f they were at the tme of ntervew. The problem s to predct the choce of current contraceptve method (no use has 629 objects, long-term methods have 334 objects, and shortterm methods have 51 objects) of a woman based on her demographc and socoeconomc characterstcs. Wsconsn breast cancer (n = 683, d = 9, k = 2): Ths dataset contans 683 objects, whch characterzed by nne features: clump thckness, cell sze unformty, cell shape unformty, margnal adheson, sngle epthelal cell sze, bare nucle, bland chromatn, normal nucleol, and mtoses. There are two clusters n the data: malgnant (444 objects) and bengn (239 objects). For evaluatng the effcency of clusterng algorthms, we have used two famous crtera: The frst one s the mean square error (MSE), or wthn cluster varance (Eq. 1). Obvously, a small value for the MSE ndcates hgh qualty results and vce versa. The second crteron s the number of evaluatons of the objectve functon (MSE n ths study) to ndcate that how fast the respectve algorthm can fnd the soluton of the gven dataset. Ths s shown usng abbrevaton. Clearly, the smaller value of the shows the hgh convergence to optmal soluton. In ths study, each experment s done twenty tmes and the average and the standard devaton of solutons are calculated and reported as well as the best and worst solutons. Table 1 lsts the results of the experments. The smulaton results gven n Table 1 confrm that the proposed approach, KM-HS, s robust and faster n comparson wth other algorthms. In terms of MSE, whch shows the qualty of resultng clusters, KM-HS provdes the optmum value and small standard devaton n all the test datasets. The KM-HS converges to the global optmum of, , and on the rs, wne, CMC and cancer datasets, respectvely n all of the runs, whch these are better than other approaches. The standard devaton of the solutons found by the KM-HS s for all of the test datasets, meanng that, t mght converge to optmal value n all of the runs, whereas other approaches converge to local optma n some of the runs. In terms of the number of functon evaluatons (), K-means algorthm s better than other methods. However, the qualty of the output of the K-means algorthm s not satsfactory. In compare to other methods, the KM-HS needs the least number of functon evaluatons. In bref, the results confrm that KM-HS has three sgnfcant merts n comparson to other methods. Frstly, t s a robust approach and able to fnd hgh qualty clusters n all the test datasets. Secondly, t s a vable approach that can converge to global optmum n all runs. Fnally, t s a fast algorthm and converges to optmal soluton more quckly than other methods. 5 Concluson A hybrd clusterng approach has been developed n ths work, whch s based on K-means and a heurstc search algorthm. In the proposed algorthm, the K-means s used to produce an ntal soluton to
5 the clusterng problem and after that a heurstc search algorthm has been appled to mprove the qualty of ths soluton by searchng around t. The performance of the proposed algorthm s evaluated usng a number of standard benchmark datasets. The smulaton results confrm that the proposed KM-HS algorthm able to obtan hgh qualty clusters. Moreover, the convergence speed of the proposed algorthm s more quckly than other methods n comparson. 6 References [1] J. Han, M.K.: Data Mnng: Concepts and Technques ( Academc Press, 21.) [2] Ru, X., and Wunsch, D., II: Survey of clusterng algorthms, Neural Networks, IEEE Transactons on, 16, (3), pp , 25. [3] Barn, M., and Gualter, R.: A new possblstc clusterng algorthm for lne detecton n real world magery, Pattern Recognton, 32, (11), pp , [4] Ca, W., Chen, S., and Zhang, D.: Fast and robust fuzzy c-means clusterng algorthms ncorporatng local nformaton for mage segmentaton, Pattern Recognton, 4, (3), pp , 27. [5] Cnque, L., Forest, G., and Lombard, L.: A clusterng fuzzy approach for mage segmentaton, Pattern Recognton, 37, (9), pp , 24. [6] Fan, J., Han, M., and Wang, J.: Sngle pont teratve weghted fuzzy C-means clusterng algorthm for remote sensng mage segmentaton, Pattern Recognton, 42, (11), pp , 29. [11] Al-Sultan, K.S.: A Tabu search approach to the clusterng problem, Pattern Recognton, 28, (9), pp , [12] Chng-Y, C., and Fun, Y.: Partcle swarm optmzaton algorthm and ts applcaton to clusterng analyss, n Edtor (Ed.)^(Eds.): Book Partcle swarm optmzaton algorthm and ts applcaton to clusterng analyss, pp , Vol.782, 24. [13] Cowgll, M.C., Harvey, R.J., and Watson, L.T.: A genetc algorthm approach to cluster analyss, Computers & Mathematcs wth Applcatons, 37, (7), pp , [14] Fathan, M., Amr, B., and Maroos, A.: Applcaton of honey-bee matng optmzaton algorthm on clusterng, Appled Mathematcs and Computaton, 19, (2), pp , 27. [15] Selm, S.Z., and Alsultan, K.: A smulated annealng algorthm for the clusterng problem, Pattern Recognton, 24, (1), pp , [16] Shelokar, P.S., Jayaraman, V.K., and Kulkarn, B.D.: An ant colony approach for clusterng, Analytca Chmca Acta, 59, (2), pp , 24. [17] Jan, A.K.: Data clusterng: 5 years beyond K- means, Pattern Recognton Letters, 31, (8), pp , 21. [18] C.L. Blake, C.J.M.: UCI repostory of machne learnng databases. Avalable from: < [7] Scheunders, P.: A genetc c-means clusterng algorthm appled to color mage quantzaton, Pattern Recognton, 3, (6), pp , [8] Tjh, W.-C., and Chen, L.: Possblstc fuzzy coclusterng of large document collectons, Pattern Recognton, 4, (12), pp , 27. [9] Forgy, E.W.: Cluster analyss of multvarate data: effcency versus nterpretablty of classfcatons, Bometrcs, 21, pp. 2, [1] Selm, S.Z., and Ismal, M.A.: K-Means-Type Algorthms: A Generalzed Convergence Theorem and Characterzaton of Local Optmalty, Pattern Analyss and Machne Intellgence, IEEE Transactons on, PAMI-6, (1), pp , 1984.
Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
More informationUnsupervised Learning
Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationClustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15
CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationResearch of Neural Network Classifier Based on FCM and PSO for Breast Cancer Classification
Research of Neural Network Classfer Based on FCM and PSO for Breast Cancer Classfcaton Le Zhang 1, Ln Wang 1, Xujewen Wang 2, Keke Lu 2, and Ajth Abraham 3 1 Shandong Provncal Key Laboratory of Network
More informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationHistogram based Evolutionary Dynamic Image Segmentation
Hstogram based Evolutonary Dynamc Image Segmentaton Amya Halder Computer Scence & Engneerng Department St. Thomas College of Engneerng & Technology Kolkata, Inda amya_halder@ndatmes.com Arndam Kar and
More informationNetwork Intrusion Detection Based on PSO-SVM
TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationClustering. A. Bellaachia Page: 1
Clusterng. Obectves.. Clusterng.... Defntons... General Applcatons.3. What s a good clusterng?. 3.4. Requrements 3 3. Data Structures 4 4. Smlarty Measures. 4 4.. Standardze data.. 5 4.. Bnary varables..
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationA Notable Swarm Approach to Evolve Neural Network for Classification in Data Mining
A Notable Swarm Approach to Evolve Neural Network for Classfcaton n Data Mnng Satchdananda Dehur 1, Bjan Bhar Mshra 2 and Sung-Bae Cho 1 1 Soft Computng Laboratory, Department of Computer Scence, Yonse
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationA hybrid sequential approach for data clustering using K-Means and particle swarm optimization algorithm
MultCraft Internatonal Journal of Engneerng, Scence and Technology Vol., No. 6, 00, pp. 67-76 INTERNATIONAL JOURNAL OF ENGINEERING, SCIENCE AND TECHNOLOGY www.jest-ng.com 00 MultCraft Lmted. All rghts
More informationK-means Optimization Clustering Algorithm Based on Hybrid PSO/GA Optimization and CS validity index
Orgnal Artcle Prnt ISSN: 3-6379 Onlne ISSN: 3-595X DOI: 0.7354/jss/07/33 K-means Optmzaton Clusterng Algorthm Based on Hybrd PSO/GA Optmzaton and CS valdty ndex K Jahanbn *, F Rahmanan, H Rezae 3, Y Farhang
More informationK-means and Hierarchical Clustering
Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationClustering Algorithm of Similarity Segmentation based on Point Sorting
Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan
More informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationA fast algorithm for color image segmentation
Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au
More informationClassifier Swarms for Human Detection in Infrared Imagery
Classfer Swarms for Human Detecton n Infrared Imagery Yur Owechko, Swarup Medasan, and Narayan Srnvasa HRL Laboratores, LLC 3011 Malbu Canyon Road, Malbu, CA 90265 {owechko, smedasan, nsrnvasa}@hrl.com
More informationComplexity Analysis of Problem-Dimension Using PSO
Proceedngs of the 7th WSEAS Internatonal Conference on Evolutonary Computng, Cavtat, Croata, June -4, 6 (pp45-5) Complexty Analyss of Problem-Dmenson Usng PSO BUTHAINAH S. AL-KAZEMI AND SAMI J. HABIB,
More informationA new segmentation algorithm for medical volume image based on K-means clustering
Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based
More informationChinese Word Segmentation based on the Improved Particle Swarm Optimization Neural Networks
Chnese Word Segmentaton based on the Improved Partcle Swarm Optmzaton Neural Networks Ja He Computatonal Intellgence Laboratory School of Computer Scence and Engneerng, UESTC Chengdu, Chna Department of
More informationSHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2011; 3:485-494 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH S. Gholzadeh *,, A. Barzegar and Ch. Gheyratmand
More informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationIntelligent Information Acquisition for Improved Clustering
Intellgent Informaton Acquston for Improved Clusterng Duy Vu Unversty of Texas at Austn duyvu@cs.utexas.edu Mkhal Blenko Mcrosoft Research mblenko@mcrosoft.com Prem Melvlle IBM T.J. Watson Research Center
More informationClustering using Vector Membership: An Extension of the Fuzzy C-Means Algorithm
Clusterng usng Vector Membershp: An Extenson of the Fuzzy C-Means Algorthm Srnjoy Ganguly 1, Dgbalay Bose, Amt Konar 3 1,,3 Department of Electroncs & Telecommuncaton Engneerng, Jadavpur Unversty, Kolkata,
More informationRecommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm
Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationAn Evolvable Clustering Based Algorithm to Learn Distance Function for Supervised Environment
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 7, Issue 5, September 2010 ISSN (Onlne): 1694-0814 www.ijcsi.org 374 An Evolvable Clusterng Based Algorthm to Learn Dstance Functon for Supervsed
More informationMulticriteria Decision Making
Multcrtera Decson Makng Andrés Ramos (Andres.Ramos@comllas.edu) Pedro Sánchez (Pedro.Sanchez@comllas.edu) Sonja Wogrn (Sonja.Wogrn@comllas.edu) Contents 1. Basc concepts 2. Contnuous methods 3. Dscrete
More informationNovel Fuzzy logic Based Edge Detection Technique
Novel Fuzzy logc Based Edge Detecton Technque Aborsade, D.O Department of Electroncs Engneerng, adoke Akntola Unversty of Tech., Ogbomoso. Oyo-state. doaborsade@yahoo.com Abstract Ths paper s based on
More informationAPPLICATION OF IMPROVED K-MEANS ALGORITHM IN THE DELIVERY LOCATION
An Open Access, Onlne Internatonal Journal Avalable at http://www.cbtech.org/pms.htm 2016 Vol. 6 (2) Aprl-June, pp. 11-17/Sh Research Artcle APPLICATION OF IMPROVED K-MEANS ALGORITHM IN THE DELIVERY LOCATION
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationTHE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT
Journal of Theoretcal and Appled Informaton Technology 30 th Aprl 013. Vol. 50 No.3 005-013 JATIT & LLS. All rghts reserved. ISSN: 199-8645 www.jatt.org E-ISSN: 1817-3195 THE PATH PLANNING ALGORITHM AND
More informationAn Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem
An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
More informationResearch and Application of Fingerprint Recognition Based on MATLAB
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationIdentification of a Gaussian Fuzzy Classifier
8 Internatonal Journal of Control, Automaton, and Systems Vol., No., March 004 Identfcaton of a Gaussan Fuzzy Classfer Heesoo Hwang Abstract: Ths paper proposes an approach to dervng a fuzzy classfer based
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationHybridization of Expectation-Maximization and K-Means Algorithms for Better Clustering Performance
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 2 Sofa 2016 Prnt ISSN: 1311-9702; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-2016-0017 Hybrdzaton of Expectaton-Maxmzaton
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationFrom Comparing Clusterings to Combining Clusterings
Proceedngs of the Twenty-Thrd AAAI Conference on Artfcal Intellgence (008 From Comparng Clusterngs to Combnng Clusterngs Zhwu Lu and Yuxn Peng and Janguo Xao Insttute of Computer Scence and Technology,
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More information1. Introduction. Abstract
Image Retreval Usng a Herarchy of Clusters Danela Stan & Ishwar K. Seth Intellgent Informaton Engneerng Laboratory, Department of Computer Scence & Engneerng, Oaland Unversty, Rochester, Mchgan 48309-4478
More informationSHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE
SHAPE RECOGNITION METHOD BASED ON THE k-nearest NEIGHBOR RULE Dorna Purcaru Faculty of Automaton, Computers and Electroncs Unersty of Craoa 13 Al. I. Cuza Street, Craoa RO-1100 ROMANIA E-mal: dpurcaru@electroncs.uc.ro
More informationFeature Selection as an Improving Step for Decision Tree Construction
2009 Internatonal Conference on Machne Learnng and Computng IPCSIT vol.3 (2011) (2011) IACSIT Press, Sngapore Feature Selecton as an Improvng Step for Decson Tree Constructon Mahd Esmael 1, Fazekas Gabor
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationOptimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition
Optmal Desgn of onlnear Fuzzy Model by Means of Independent Fuzzy Scatter Partton Keon-Jun Park, Hyung-Kl Kang and Yong-Kab Km *, Department of Informaton and Communcaton Engneerng, Wonkwang Unversty,
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationBackpropagation: In Search of Performance Parameters
Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationBOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET
1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School
More informationClassifier Ensemble Design using Artificial Bee Colony based Feature Selection
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 3, No 2, May 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 522 Classfer Ensemble Desgn usng Artfcal Bee Colony based Feature Selecton Shunmugaprya
More informationDetermining Fuzzy Sets for Quantitative Attributes in Data Mining Problems
Determnng Fuzzy Sets for Quanttatve Attrbutes n Data Mnng Problems ATTILA GYENESEI Turku Centre for Computer Scence (TUCS) Unversty of Turku, Department of Computer Scence Lemmnkäsenkatu 4A, FIN-5 Turku
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationFuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval
Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,
More informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationS.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?
S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert
More information