Testing effectiveness of genetic algorithms for exploratory data analysis - Info and Reading Options
By Jason W. Carter

"Testing effectiveness of genetic algorithms for exploratory data analysis" was published by Naval Postgraduate School in 1997 - Monterey, Calif, it has 65 pages and the language of the book is English.
“Testing effectiveness of genetic algorithms for exploratory data analysis” Metadata:
- Title: ➤ Testing effectiveness of genetic algorithms for exploratory data analysis
- Author: Jason W. Carter
- Language: English
- Number of Pages: 65
- Publisher: Naval Postgraduate School
- Publish Date: 1997
- Publish Location: Monterey, Calif
“Testing effectiveness of genetic algorithms for exploratory data analysis” Subjects and Themes:
- Subjects: ALGORITHMS - PERSIAN GULF WAR - HEURISTIC METHODS - GENETICS - ILLNESS
Edition Specifications:
- Pagination: x, 65 p. ;
Edition Identifiers:
- The Open Library ID: OL25303572M - OL16622564W
- Online Computer Library Center (OCLC) ID: 640490282
AI-generated Review of “Testing effectiveness of genetic algorithms for exploratory data analysis”:
"Testing effectiveness of genetic algorithms for exploratory data analysis" Description:
The Open Library:
Heuristic methods of solving exploratory data analysis problems suffer from one major weakness - uncertainty regarding the optimality of the results. The developers of DaMI (Data Mining Initiative), a genetic algorithm designed to mine the CCEP (Comprehensive Clinical Evaluation Program) database in the search for a Persian Gulf War syndrome, proposed a method to overcome this weakness: reproducibility -- the conjecture that consistent convergence on the same solutions is both necessary and sufficient to ensure a genetic algorithm has effectively searched an unknown solution space. We demonstrate the weakness of this conjecture in light of accepted genetic algorithm theory. We then test the conjecture by modifying the CCEP database with the insertion of an interesting solution of known quality and performing a discovery session using DaMI on this modified database. The necessity of reproducibility as a terminating condition is falsified by the algorithm finding the optimal solution without yielding strong reproducibility. The sufficiency of reproducibility as a terminating condition is analyzed by manual examination of the CCEP database in which strong reproducibility was experienced. Ex post facto knowledge of the solution space is used to prove that DaMI had not found the optimal solutions though it gave strong reproducibility, causing us to reject the conjecture that strong reproducibile is a sufficient terminating condition.
Read “Testing effectiveness of genetic algorithms for exploratory data analysis”:
Read “Testing effectiveness of genetic algorithms for exploratory data analysis” by choosing from the options below.
Search for “Testing effectiveness of genetic algorithms for exploratory data analysis” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Testing effectiveness of genetic algorithms for exploratory data analysis" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: full
- Check if available: The Open Library & The Internet Archive
Find “Testing effectiveness of genetic algorithms for exploratory data analysis” in Libraries Near You:
Read or borrow “Testing effectiveness of genetic algorithms for exploratory data analysis” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Testing effectiveness of genetic algorithms for exploratory data analysis” at a library near you.
Buy “Testing effectiveness of genetic algorithms for exploratory data analysis” online:
Shop for “Testing effectiveness of genetic algorithms for exploratory data analysis” on popular online marketplaces.
- Ebay: New and used books.