{"title":"High performance clustering for large data warehouses using peer-to-peer genetic algorithm","authors":"M.N. Shah, R. Mahmood","doi":"10.1109/INMIC.2003.1416762","DOIUrl":null,"url":null,"abstract":"High volumes of data pose a challenge to the scalability of data mining algorithms. Dividing this data into equal partitions and processing it in parallel naturally becomes a choice. Peer-to-peer computing exposes a bright source for exploiting parallelism and maintaining scale-up capability. We consider parallelism in genetic algorithms while computing the fitness of the population individuals (chromosomes). This strategy has an edge over its counterpart, that is, parallelism in genetic operators, because genetic operators tend to be computationally cheap. Simply speaking this scheme supports large data sets, that is. larger the data size, larger will be the degree of parallelism achieved.","PeriodicalId":253329,"journal":{"name":"7th International Multi Topic Conference, 2003. INMIC 2003.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Multi Topic Conference, 2003. INMIC 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INMIC.2003.1416762","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
High volumes of data pose a challenge to the scalability of data mining algorithms. Dividing this data into equal partitions and processing it in parallel naturally becomes a choice. Peer-to-peer computing exposes a bright source for exploiting parallelism and maintaining scale-up capability. We consider parallelism in genetic algorithms while computing the fitness of the population individuals (chromosomes). This strategy has an edge over its counterpart, that is, parallelism in genetic operators, because genetic operators tend to be computationally cheap. Simply speaking this scheme supports large data sets, that is. larger the data size, larger will be the degree of parallelism achieved.