Welcome to the InfoSci Platform
Reference Hub4
Customer Profiling in Complex Analytical Environments Using Swarm Intelligence Algorithms

Customer Profiling in Complex Analytical Environments Using Swarm Intelligence Algorithms

Goran Klepac
Copyright: © 2016 |Volume: 7 |Issue: 3 |Pages: 28
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781466691582|DOI: 10.4018/IJSIR.2016070103
Cite Article Cite Article

MLA

Klepac, Goran. "Customer Profiling in Complex Analytical Environments Using Swarm Intelligence Algorithms." IJSIR vol.7, no.3 2016: pp.43-70. http://doi.org/10.4018/IJSIR.2016070103

APA

Klepac, G. (2016). Customer Profiling in Complex Analytical Environments Using Swarm Intelligence Algorithms. International Journal of Swarm Intelligence Research (IJSIR), 7(3), 43-70. http://doi.org/10.4018/IJSIR.2016070103

Chicago

Klepac, Goran. "Customer Profiling in Complex Analytical Environments Using Swarm Intelligence Algorithms," International Journal of Swarm Intelligence Research (IJSIR) 7, no.3: 43-70. http://doi.org/10.4018/IJSIR.2016070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Customer profiling is always an interesting task from perspective of business. It became even bigger challenge in situation of complex analytical environment. Complex analytical environment can be caused by multiple modality of output variable as well as from big data environment, which cause data complexity in way of data quantity. As an illustration of presented concept particle swarm optimization algorithm will be used as a tool, which will find profiles from developed predictive model of neural network. Presented methodology has practical value for decision support in business, where information about customer profiles which prefers to buy some product or group products are valuable information for campaign planning and customer portfolio management.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.