@mastersthesis{schmidhuber:1987:srl, title = {Evolutionary Principles in Self-Referential Learning. On Learning now to Learn: The Meta-Meta-Meta...-Hook}, author = {Jurgen Schmidhuber}, month = {14 May}, school = {Technische Universitat Munchen, Germany}, type = {Diploma Thesis}, year = 1987, url = {http://www.idsia.ch/~juergen/diploma.html}, size = {62 pages}, biburl = {http://www.bibsonomy.org/bibtex/2a96f7c3d42103ab94b13badef5d869f0/brazovayeye}, keywords = {self-reference, brigade, fractals genetic genetical neuronal introsepection, algorithms, associative EURISKO, programming learning, SALM, PSALM, bucket algorithm, nets, meta, evolution,} } @article{garzon:2003:GPEM, title = {Self-Assembly of {DNA}-like Structures In Silico}, author = {Max Garzon and Derrel Blain and Kiran Bobba and Andrew Neel and Michael West}, journal = {Genetic Programming and Evolvable Machines}, month = {June}, number = 2, pages = {185--200}, volume = 4, year = 2003, issn = {1389-2576}, doi = {doi:10.1023/A:1023989130306}, abstract = {Through evolution, biomolecules have resolved fundamental problems as a highly interactive parallel and distributed system that we are just beginning to decipher. Biomolecular Computing (BMC) protocols, however, are unreliable, inefficient and unscalable when compared to computational algorithms run in silico. An alternative approach is explored to exploiting these properties by building biomolecular analogs (eDNA) and virtual test tubes in electronics that would capture the best of both worlds. A distributed implementation is described of a virtual tube, Edna, on a cluster of PCs that does capture the massive asynchronous parallel interactions typical of BMC. Results are reported from over 1000 experiments that calibrate and benchmark Edna's performance, reproduce and extend Adleman's solution to the Hamiltonian Path problem for larger families of graphs than has been possible on a single processor or has been actually carried out in wet labs, and benchmark the feasibility and performance of DNA-based associative memories. The results required a million-fold less molecules and are at least as reliable as in vitro experiments, and so provide strong evidence that the paradigm of molecular computing can be implemented much more efficiently (in terms of time, cost, and probability of success) in silico than the corresponding wet experiments, at least in the range where Edna can be practically run. This approach also demonstrates intrinsic advantages in using electronic analogs of DNA as genomes for genetic algorithms and evolutionary computation.}, biburl = {http://www.bibsonomy.org/bibtex/2fea4ac78a4531d4d5f89c805a9599e9b/brazovayeye}, keywords = {DNA-based associative computing, genetic online problem, efficiency algorithms, reaction protocols DNA kinetics path in computational memories, Hamiltonian of} } @article{YunSeogYeun:2001:IS, title = {Function approximations by superimposing genetic programming trees:with applications to engineering problems}, author = {Yun Seog Yeun and Jun Chen Suh and Young-Soon Yang}, journal = {Information Sciences}, number = {2-4}, pages = {259--280}, volume = 122, year = 2000, url = {http://www.elsevier.com/gej-ng/10/23/143/56/27/34/article.pdf}, email = {yeonyun@road.daejin.ac.kr}, doi = {doi:10.1016/S0020-0255(99)00121-8}, abstract = {This paper concerns fundamental issues regarding genetic programming (GP) as a tool for real-valued function approximations. Standard GP suffers from the lack of estimation techniques for numerical parameters of a functional tree. Unlike other research activities, where non-linear optimization techniques are employed, we adopt the use of a linear associative memory for the estimation of these parameters under the GP algorithm. Instead of dealing with a large associative matrix, we present the method of building several associative matrixes in small size, each of which is responsible for determining the value for different small portions of the whole parameter. This approach can significantly reduce computational cost, and a reasonably accurate value for parameters can be obtained. Due to the fact that the GP algorithm is likely to fall into a local minimum, the GP algorithm often fails to generate the functional tree with the desired accuracy. This motivates us to devise a group of additive genetic programming trees(GAGPT) which consists of a primary tree and a set of auxiliary trees. The output of the GAGPT is the summation of outputs of the primary tree and all auxiliary trees. The addition of auxiliary trees makes it possible to improve both the learning and generalization capability of the GAGPT, since the auxiliary tree evolves toward refining the quality of the GAGPT by optimizing its fitness function. The effectiveness of our approach is verified by applying the GAGPT to the estimation of the principal dimensions of a bulk cargo ship and engine torque of a passenger car.}, biburl = {http://www.bibsonomy.org/bibtex/2765d034dfdac82058454b7b4f9434e09/brazovayeye}, keywords = {Group associative Function Linear memory, programming, genetic programming algorithms, tree additive approximation, of} } @book{chandler07semiotics, title = {Semiotics: The Basics}, author = {Daniel Chandler}, edition = {Second}, publisher = {Taylor & Francis}, year = 2007, biburl = {http://www.bibsonomy.org/bibtex/24c47ce339759c5ac03c1f4665520e788/stumme}, keywords = {sign associative Saussure paradigms semiotics syntagmatic paradigmatic syntagms relations} } @article{Zografski1997, title = {Learning associative memory predictors from time series}, author = {Zlatko Zografski and Tariq Durrani}, journal = {Signal Processing}, month = {Jun}, number = 2, pages = {243--249}, volume = 59, year = 1997, url = {http://www.sciencedirect.com/science/article/B6V18-3SP2D2W-9/1/bf96349b85bf17843125cb7cf4db890e}, biburl = {http://www.bibsonomy.org/bibtex/251bbc2e445b23edc987a50459232307f/smicha}, keywords = {memories Associative} } @article{Li2005m, title = {Delay-dependent exponential stability analysis of bi-directional associative memory neural networks with time delay: an LMI approach}, author = {Chuandong Li and Xiaofeng Liao and Rong Zhang}, journal = {Chaos, Solitons \& Fractals}, month = {May}, number = 4, pages = {1119--1134}, volume = 24, year = 2005, url = {http://www.sciencedirect.com/science/article/B6TJ4-4DTTBN8-3/1/6fb2fd597b29394a1da72099dcde6417}, description = {Chaos, Solitons & Fractals}, biburl = {http://www.bibsonomy.org/bibtex/2cb8d97eb0dab57175de75f0cd3114bdf/smicha}, keywords = {neural associative network memory Bi-directional} } @inproceedings{li07adapting, title = {Adapting Associative Classification to Text Categorization}, author = {Baoli Li and Neha Sugandh and Ernest V. Garcia and Ashwin Ram}, booktitle = {Proceedings of the 2007 ACM Symposium on Document Engineering (DocEng '07), August 28 - 31, 2007, Winnipeg, Manitoba, Canada}, editor = {Peter King and Steven Simske}, pages = {205--208}, publisher = {ACM, New York, NY, USA}, year = 2007, url = {http://doi.acm.org/10.1145/1284420.1284470}, isbn = {978-1-59593-776-6}, description = {Adapting associative classification to text categorization}, biburl = {http://www.bibsonomy.org/bibtex/2f4852d99d7e787862a0393e96a87fa6e/sb3000}, keywords = {associative text-classification} } @inproceedings{DBLP:conf/iccs/FerreR02, title = {The Use of Associative Concepts in the Incremental Building of a Logical Context.}, author = {S{\'e}bastien Ferr{\'e} and Olivier Ridoux}, booktitle = {Proceedings of the 10th International Conference on Conceptual Structures (ICCS 2002)}, crossref = {DBLP:conf/iccs/2002}, editor = {Uta Priss and Dan Corbett and Galia Angelova}, pages = {299-313}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = 2393, year = 2002, ee = {http://link.springer.de/link/service/series/0558/bibs/2393/23930299.htm}, bibsource = {DBLP, http://dblp.uni-trier.de}, isbn = {3-540-43901-3}, biburl = {http://www.bibsonomy.org/bibtex/23467e3d34eb495499f6d989967d66f62/iccs}, keywords = {fca concept 2002 associative formal logical context iccs analysis} } @inproceedings{DBLP:conf/iccs/Priss02, title = {Associative and Formal Concepts.}, author = {Uta Priss}, booktitle = {Proceedings of the 10th International Conference on Conceptual Structures (ICCS 2002)}, crossref = {DBLP:conf/iccs/2002}, editor = {Uta Priss and Dan Corbett and Galia Angelova}, pages = {354-368}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = 2393, year = 2002, ee = {http://link.springer.de/link/service/series/0558/bibs/2393/23930354.htm}, bibsource = {DBLP, http://dblp.uni-trier.de}, isbn = {3-540-43901-3}, biburl = {http://www.bibsonomy.org/bibtex/254bc25debae8634c5d06ee067b45f3a8/iccs}, keywords = {2002 concept analysis fca associative formal iccs} }