Non-Standard Parameter Adaptation for Exploratory Data Analysis
Studies in computational intelligencePublished 1 January 2009
Wesam Ashour Barbakh, Ying Wu, Colin Fyfe
Citations37
SJR quartileQ4
SJR score0.19
SNIP0.29
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This book first lays the groundwork by reviewing some standard clustering algorithms and projection algorithms before presenting various non-standard criteria for clustering, and considers extensions of the basic mappings which maintain some topology of the original data space.
Abstract
Exploratory data analysis, also known as data mining or knowledge discovery from databases, is typically based on the optimisation of a specific function of a dataset. Such optimisation is often perfo
Keywords
Computer Science
Journal of Artificial Intelligence ResearchEvolutionary Algorithms for Reinforcement Learning
343 Citations1999David E. Moriarty, Anna Charlotte Schultz +1 more
Strengths and weaknesses of the evolutionary approach to reinforcement learning are presented, along with a survey of representative applications.
Lecture notes in computer scienceClustering with Reinforcement Learning
18 Citations2007Wesam Ashour Barbakh, Colin Fyfe
Three novel reward functions are developed which show great promise in overcoming poor initialization of cluster prototypes and are used to create topology preserving mappings in clustering methods.
The 2006 IEEE International Joint Conference on Neural Network ProceedingsGlobal Reinforcement Learning in Neural Networks with Stochastic Synapses
2 Citations2006Xiaolong Ma, Konstantin K. Likharev
Studies in computational intelligenceConnectivity Graphs and Clustering with Similarity Functions
1 Citations2009Wesam Ashour Barbakh, Ying Choon Wu +1 more
This section reviews two popular methods to construct a similarity graph, and a new algorithm is introduced that solves some problems that can not be solved by the others.
