Intensional Encapsulations of Database Subsets via Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.7642

@InProceedings{conf/dexa/AcarM05,

• title = "Intensional Encapsulations of Database Subsets via Genetic Programming",
• author = "Aybar C. Acar and Amihai Motro",
• year = "2005",
• pages = "365--374",
• editor = "Kim Viborg Andersen and John K. Debenham and Roland Wagner",
• publisher = "Springer",
• series = "Lecture Notes in Computer Science",
• volume = "3588",
• booktitle = "Database and Expert Systems Applications, 16th International Conference, DEXA 2005, Proceedings",
• address = "Copenhagen, Denmark",
• month = aug # " 22-26",
• bibdate = "2005-11-03",
• bibsource = "DBLP, http://dblp.uni-trier.de/db/conf/dexa/dexa2005.html#AcarM05",
• keywords = "genetic algorithms, genetic programming",
• ISBN = "3-540-28566-0",
• DOI = "doi:10.1007/11546924_36",
• size = "10 pages",
• abstract = "Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extension (a set of data values), intensional encapsulation assigns an intensional expression to a given set of data values. We describe a method for deriving intensional representations of subsets of records in large database tables. Our method is based on the paradigm of genetic programming. It is shown to achieve high accuracy and maintain compact expression size, while requiring cost that is acceptable to all applications, but those that require instantaneous results. Intensional encapsulation has a broad range of applications including cooperative answering, information integration, security and data mining.",
• notes = "See also \cite{AcarM05tr}",

}

Genetic Programming entries for Aybar C Acar Amihai (Ami) Motro

Citations