FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1498981693> ?p ?o ?g. }

• W1498981693 abstract "<p>Using evolutionary intelligence and machine learning techniques, a broad range of intelligent machines have been designed to perform different tasks. An intelligent machine learns by perceiving its environmental status and taking an action that maximizes its chances of success. Human beings have the ability to apply knowledge learned from a smaller problem to more complex, large-scale problems of the same or a related domain, but currently the vast majority of evolutionary machine learning techniques lack this ability. This lack of ability to apply the already learned knowledge of a domain results in consuming more than the necessary resources and time to solve complex, large-scale problems of the domain. As the problem increases in size, it becomes difficult and even sometimes impractical (if not impossible) to solve due to the needed resources and time. Therefore, in order to scale in a problem domain, a systemis needed that has the ability to reuse the learned knowledge of the domain and/or encapsulate the underlying patterns in the domain. To extract and reuse building blocks of knowledge or to encapsulate the underlying patterns in a problem domain, a rich encoding is needed, but the search space could then expand undesirably and cause bloat, e.g. as in some forms of genetic programming (GP). Learning classifier systems (LCSs) are a well-structured evolutionary computation based learning technique that have pressures to implicitly avoid bloat, such as fitness sharing through niche based reproduction. The proposed thesis is that an LCS can scale to complex problems in a domain by reusing the learnt knowledge from simpler problems of the domain and/or encapsulating the underlying patterns in the domain. Wilson’s XCS is used to implement and test the proposed systems, which is a well-tested, online learning and accuracy based LCS model. To extract the reusable building blocks of knowledge, GP-tree like, code-fragments are introduced, which are more than simply another representation (e.g. ternary or real-valued alphabets). This thesis is extended to capture the underlying patterns in a problemusing a cyclic representation. Hard problems are experimented to test the newly developed scalable systems and compare them with benchmark techniques. Specifically, this work develops four systems to improve the scalability of XCS-based classifier systems. (1) Building blocks of knowledge are extracted fromsmaller problems of a Boolean domain and reused in learning more complex, large-scale problems in the domain, for the first time. By utilizing the learnt knowledge from small-scale problems, the developed XCSCFC (i.e. XCS with Code-Fragment Conditions) system readily solves problems of a scale that existing LCS and GP approaches cannot, e.g. the 135-bitMUX problem. (2) The introduction of the code fragments in classifier actions in XCSCFA (i.e. XCS with Code-Fragment Actions) enables the rich representation of GP, which when couples with the divide and conquer approach of LCS, to successfully solve various complex, overlapping and niche imbalance Boolean problems that are difficult to solve using numeric action based XCS. (3) The underlying patterns in a problem domain are encapsulated in classifier rules encoded by a cyclic representation. The developed XCSSMA system produces general solutions of any scale n for a number of important Boolean problems, for the first time in the field of LCS, e.g. parity problems. (4) Optimal solutions for various real-valued problems are evolved by extending the existing real-valued XCSR system with code-fragment actions to XCSRCFA. Exploiting the combined power of GP and LCS techniques, XCSRCFA successfully learns various continuous action and function approximation problems that are difficult to learn using the base techniques. This research work has shown that LCSs can scale to complex, largescale problems through reusing learnt knowledge. The messy nature, disassociation of message to condition order, masking, feature construction, and reuse of extracted knowledge add additional abilities to the XCS family of LCSs. The ability to use rich encoding in antecedent GP-like codefragments or consequent cyclic representation leads to the evolution of accurate, maximally general and compact solutions in learning various complex Boolean as well as real-valued problems. Effectively exploiting the combined power of GP and LCS techniques, various continuous action and function approximation problems are solved in a simple and straight forward manner. The analysis of the evolved rules reveals, for the first time in XCS, that no matter how specific or general the initial classifiers are, all the optimal classifiers are converged through the mechanism ‘be specific then generalize’ near the final stages of evolution. Also that standard XCS does not use all available information or all available genetic operators to evolve optimal rules, whereas the developed code-fragment action based systems effectively use figure and ground information during the training process. Thiswork has created a platformto explore the reuse of learnt functionality, not just terminal knowledge as present, which is needed to replicate human capabilities.</p>" @default.
• W1498981693 created "2016-06-24" @default.
• W1498981693 creator A5065401444 @default.
• W1498981693 date "2021-11-14" @default.
• W1498981693 modified "2023-10-14" @default.
• W1498981693 title "Improving the Scalability of XCS-Based Learning Classifier Systems" @default.
• W1498981693 doi "https://doi.org/10.26686/wgtn.17006398" @default.
• W1498981693 hasPublicationYear "2021" @default.
• W1498981693 type Work @default.
• W1498981693 sameAs 1498981693 @default.
• W1498981693 citedByCount "2" @default.
• W1498981693 countsByYear W14989816932015 @default.
• W1498981693 countsByYear W14989816932020 @default.
• W1498981693 crossrefType "dissertation" @default.
• W1498981693 hasAuthorship W1498981693A5065401444 @default.
• W1498981693 hasBestOaLocation W14989816931 @default.
• W1498981693 hasConcept C105902424 @default.
• W1498981693 hasConcept C110332635 @default.
• W1498981693 hasConcept C119857082 @default.
• W1498981693 hasConcept C121332964 @default.
• W1498981693 hasConcept C127413603 @default.
• W1498981693 hasConcept C134306372 @default.
• W1498981693 hasConcept C154945302 @default.
• W1498981693 hasConcept C159149176 @default.
• W1498981693 hasConcept C206588197 @default.
• W1498981693 hasConcept C207685749 @default.
• W1498981693 hasConcept C2778755073 @default.
• W1498981693 hasConcept C33923547 @default.
• W1498981693 hasConcept C36503486 @default.
• W1498981693 hasConcept C41008148 @default.
• W1498981693 hasConcept C48044578 @default.
• W1498981693 hasConcept C548081761 @default.
• W1498981693 hasConcept C62520636 @default.
• W1498981693 hasConcept C77088390 @default.
• W1498981693 hasConcept C95623464 @default.
• W1498981693 hasConcept C97541855 @default.
• W1498981693 hasConceptScore W1498981693C105902424 @default.
• W1498981693 hasConceptScore W1498981693C110332635 @default.
• W1498981693 hasConceptScore W1498981693C119857082 @default.
• W1498981693 hasConceptScore W1498981693C121332964 @default.
• W1498981693 hasConceptScore W1498981693C127413603 @default.
• W1498981693 hasConceptScore W1498981693C134306372 @default.
• W1498981693 hasConceptScore W1498981693C154945302 @default.
• W1498981693 hasConceptScore W1498981693C159149176 @default.
• W1498981693 hasConceptScore W1498981693C206588197 @default.
• W1498981693 hasConceptScore W1498981693C207685749 @default.
• W1498981693 hasConceptScore W1498981693C2778755073 @default.
• W1498981693 hasConceptScore W1498981693C33923547 @default.
• W1498981693 hasConceptScore W1498981693C36503486 @default.
• W1498981693 hasConceptScore W1498981693C41008148 @default.
• W1498981693 hasConceptScore W1498981693C48044578 @default.
• W1498981693 hasConceptScore W1498981693C548081761 @default.
• W1498981693 hasConceptScore W1498981693C62520636 @default.
• W1498981693 hasConceptScore W1498981693C77088390 @default.
• W1498981693 hasConceptScore W1498981693C95623464 @default.
• W1498981693 hasConceptScore W1498981693C97541855 @default.
• W1498981693 hasLocation W14989816931 @default.
• W1498981693 hasLocation W14989816932 @default.
• W1498981693 hasOpenAccess W1498981693 @default.
• W1498981693 hasPrimaryLocation W14989816931 @default.
• W1498981693 hasRelatedWork W1528163502 @default.
• W1498981693 hasRelatedWork W1594809898 @default.
• W1498981693 hasRelatedWork W1978005248 @default.
• W1498981693 hasRelatedWork W2057229959 @default.
• W1498981693 hasRelatedWork W2100617252 @default.
• W1498981693 hasRelatedWork W2147656001 @default.
• W1498981693 hasRelatedWork W2167592153 @default.
• W1498981693 hasRelatedWork W2921856726 @default.
• W1498981693 hasRelatedWork W3177788952 @default.
• W1498981693 hasRelatedWork W4300744507 @default.
• W1498981693 isParatext "false" @default.
• W1498981693 isRetracted "false" @default.
• W1498981693 magId "1498981693" @default.
• W1498981693 workType "dissertation" @default.