Institutional Repository
The pearl algorithm as a method to extract information out of a database
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Kruger, JW
|
|
| dc.contributor.editor | Ram, Vevek
|
|
| dc.date.accessioned | 2018-08-15T10:02:19Z | |
| dc.date.available | 2018-08-15T10:02:19Z | |
| dc.date.issued | 1996 | |
| dc.identifier.citation | Kruger, J.W. (1996) The pearl algorithm as a method to extract information out of a database. Industry Meets Academia: Proceedings of the 1996 National Research and Development Conference, The South African Institute of Computer Scientists and Information Technologists, Interaction Conference Centre, University of Natal, Durban, 26 & 27 September, hosted by The Department of Computer Science and Information Systems, University of Natal, Pietermaritzburg, edited by Vevek Ram, (ISBN 0-620-20568-7). | en |
| dc.identifier.isbn | 0-620-20568-7 | |
| dc.identifier.uri | http://hdl.handle.net/10500/24634 | |
| dc.description.abstract | Big databases have been built up over time. The information in these databases can be converted by the Pearl algorithm [ Pearl 1988 ] from data to information. When a promotional drive is initiated, do we know who the potential customers are? The Pearl algorithm gives the belief that an individual will purchase. This means that the database can be used to select the individuals that are most likely to purchase. The break-even point, where the cost of the promotional contact and the expected return are the same, can be calculated. The Pearl algorithm uses Bayes' probabilities to propagate belief through a tree. | en |
| dc.language.iso | en | en |
| dc.title | The pearl algorithm as a method to extract information out of a database | en |
