T2K2: A Type II KASER
The transformational methodology described in this paper induces new knowledge, which may be open under any deductive process. The method of transposition is used to maintain a maximum size for the application as well as meta-rule bases. The "move to head" method is used by both the applic...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 153 |
---|---|
container_issue | |
container_start_page | 147 |
container_title | |
container_volume | |
creator | Rubin, S.H. Shu-Ching Chen Law, J.B. |
description | The transformational methodology described in this paper induces new knowledge, which may be open under any deductive process. The method of transposition is used to maintain a maximum size for the application as well as meta-rule bases. The "move to head" method is used by both the application and metarule bases for hypotheses formation. Whenever an application rule is fired, it is transposed on the transposition list and also moved to the head on the other list. If any meta-rule on a solution path individually leads to a contradiction on the application rule base, then the offending meta-rule is expunged. Then, when the system is idle enter dream mode, whereby rule i rArr rule j is generated by the 3-2-1 skewed twister as a candidate most-specific meta-rule. Candidate most-specific meta-rules are "cored" to create one generalization per candidate. These candidate meta-rules are tested for application to each rule in the application domain rule base. In order to be saved in the meta base, they may not map any existing rule in the application domain rule base to one having the same antecedent as another in this base, but a different consequent (as found by hashing). In addition, all candidate meta-rules must map at least one rule in the application base to another distinct one there, or be symmetrically induced from meta-rules that so map |
doi_str_mv | 10.1109/IRI.2006.252404 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4018481</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4018481</ieee_id><sourcerecordid>4018481</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-4f219169818109504528c4064e1d1dfff287243a80610daf20dbd9762b68c02d3</originalsourceid><addsrcrecordid>eNotjUFrwkAQRheKUNEcSw9e8gcSZ2Znd2d7C2LrEqFg07NEdxdSWhDTi_--gfr44N2-p9QzQo0Ifh0OoSYAW5MhBn5QhXcC0_RkgUdVjOMXTGhv0Lm5euqopZeyKbvbJZUhlG3zsT0s1Sz332Mq7l6oz9dtt9lV-_e3sGn21YDO_FacCT1aLyhT3AAbkjOD5YQRY86ZxBHrXsAixD4TxFP0ztLJyhko6oVa_f8OKaXj5Tr89NfbkQGFBfUfPdo0Eg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>T2K2: A Type II KASER</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Rubin, S.H. ; Shu-Ching Chen ; Law, J.B.</creator><creatorcontrib>Rubin, S.H. ; Shu-Ching Chen ; Law, J.B.</creatorcontrib><description>The transformational methodology described in this paper induces new knowledge, which may be open under any deductive process. The method of transposition is used to maintain a maximum size for the application as well as meta-rule bases. The "move to head" method is used by both the application and metarule bases for hypotheses formation. Whenever an application rule is fired, it is transposed on the transposition list and also moved to the head on the other list. If any meta-rule on a solution path individually leads to a contradiction on the application rule base, then the offending meta-rule is expunged. Then, when the system is idle enter dream mode, whereby rule i rArr rule j is generated by the 3-2-1 skewed twister as a candidate most-specific meta-rule. Candidate most-specific meta-rules are "cored" to create one generalization per candidate. These candidate meta-rules are tested for application to each rule in the application domain rule base. In order to be saved in the meta base, they may not map any existing rule in the application domain rule base to one having the same antecedent as another in this base, but a different consequent (as found by hashing). In addition, all candidate meta-rules must map at least one rule in the application base to another distinct one there, or be symmetrically induced from meta-rules that so map</description><identifier>ISBN: 9780780397880</identifier><identifier>ISBN: 0780397886</identifier><identifier>DOI: 10.1109/IRI.2006.252404</identifier><language>eng</language><publisher>IEEE</publisher><subject>Calculus ; Closed loop systems ; Clustering algorithms ; Cognition ; Computer applications ; Computing with Words ; Machine Learning ; Machine learning algorithms ; Natural Language ; Natural languages ; Randomization ; Speech synthesis ; Synthesizers ; Testing ; Translation</subject><ispartof>2006 IEEE International Conference on Information Reuse & Integration, 2006, p.147-153</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4018481$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4018481$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Rubin, S.H.</creatorcontrib><creatorcontrib>Shu-Ching Chen</creatorcontrib><creatorcontrib>Law, J.B.</creatorcontrib><title>T2K2: A Type II KASER</title><title>2006 IEEE International Conference on Information Reuse & Integration</title><addtitle>IRI</addtitle><description>The transformational methodology described in this paper induces new knowledge, which may be open under any deductive process. The method of transposition is used to maintain a maximum size for the application as well as meta-rule bases. The "move to head" method is used by both the application and metarule bases for hypotheses formation. Whenever an application rule is fired, it is transposed on the transposition list and also moved to the head on the other list. If any meta-rule on a solution path individually leads to a contradiction on the application rule base, then the offending meta-rule is expunged. Then, when the system is idle enter dream mode, whereby rule i rArr rule j is generated by the 3-2-1 skewed twister as a candidate most-specific meta-rule. Candidate most-specific meta-rules are "cored" to create one generalization per candidate. These candidate meta-rules are tested for application to each rule in the application domain rule base. In order to be saved in the meta base, they may not map any existing rule in the application domain rule base to one having the same antecedent as another in this base, but a different consequent (as found by hashing). In addition, all candidate meta-rules must map at least one rule in the application base to another distinct one there, or be symmetrically induced from meta-rules that so map</description><subject>Calculus</subject><subject>Closed loop systems</subject><subject>Clustering algorithms</subject><subject>Cognition</subject><subject>Computer applications</subject><subject>Computing with Words</subject><subject>Machine Learning</subject><subject>Machine learning algorithms</subject><subject>Natural Language</subject><subject>Natural languages</subject><subject>Randomization</subject><subject>Speech synthesis</subject><subject>Synthesizers</subject><subject>Testing</subject><subject>Translation</subject><isbn>9780780397880</isbn><isbn>0780397886</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjUFrwkAQRheKUNEcSw9e8gcSZ2Znd2d7C2LrEqFg07NEdxdSWhDTi_--gfr44N2-p9QzQo0Ifh0OoSYAW5MhBn5QhXcC0_RkgUdVjOMXTGhv0Lm5euqopZeyKbvbJZUhlG3zsT0s1Sz332Mq7l6oz9dtt9lV-_e3sGn21YDO_FacCT1aLyhT3AAbkjOD5YQRY86ZxBHrXsAixD4TxFP0ztLJyhko6oVa_f8OKaXj5Tr89NfbkQGFBfUfPdo0Eg</recordid><startdate>200609</startdate><enddate>200609</enddate><creator>Rubin, S.H.</creator><creator>Shu-Ching Chen</creator><creator>Law, J.B.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200609</creationdate><title>T2K2: A Type II KASER</title><author>Rubin, S.H. ; Shu-Ching Chen ; Law, J.B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-4f219169818109504528c4064e1d1dfff287243a80610daf20dbd9762b68c02d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Calculus</topic><topic>Closed loop systems</topic><topic>Clustering algorithms</topic><topic>Cognition</topic><topic>Computer applications</topic><topic>Computing with Words</topic><topic>Machine Learning</topic><topic>Machine learning algorithms</topic><topic>Natural Language</topic><topic>Natural languages</topic><topic>Randomization</topic><topic>Speech synthesis</topic><topic>Synthesizers</topic><topic>Testing</topic><topic>Translation</topic><toplevel>online_resources</toplevel><creatorcontrib>Rubin, S.H.</creatorcontrib><creatorcontrib>Shu-Ching Chen</creatorcontrib><creatorcontrib>Law, J.B.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rubin, S.H.</au><au>Shu-Ching Chen</au><au>Law, J.B.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>T2K2: A Type II KASER</atitle><btitle>2006 IEEE International Conference on Information Reuse & Integration</btitle><stitle>IRI</stitle><date>2006-09</date><risdate>2006</risdate><spage>147</spage><epage>153</epage><pages>147-153</pages><isbn>9780780397880</isbn><isbn>0780397886</isbn><abstract>The transformational methodology described in this paper induces new knowledge, which may be open under any deductive process. The method of transposition is used to maintain a maximum size for the application as well as meta-rule bases. The "move to head" method is used by both the application and metarule bases for hypotheses formation. Whenever an application rule is fired, it is transposed on the transposition list and also moved to the head on the other list. If any meta-rule on a solution path individually leads to a contradiction on the application rule base, then the offending meta-rule is expunged. Then, when the system is idle enter dream mode, whereby rule i rArr rule j is generated by the 3-2-1 skewed twister as a candidate most-specific meta-rule. Candidate most-specific meta-rules are "cored" to create one generalization per candidate. These candidate meta-rules are tested for application to each rule in the application domain rule base. In order to be saved in the meta base, they may not map any existing rule in the application domain rule base to one having the same antecedent as another in this base, but a different consequent (as found by hashing). In addition, all candidate meta-rules must map at least one rule in the application base to another distinct one there, or be symmetrically induced from meta-rules that so map</abstract><pub>IEEE</pub><doi>10.1109/IRI.2006.252404</doi><tpages>7</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 9780780397880 |
ispartof | 2006 IEEE International Conference on Information Reuse & Integration, 2006, p.147-153 |
issn | |
language | eng |
recordid | cdi_ieee_primary_4018481 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Calculus Closed loop systems Clustering algorithms Cognition Computer applications Computing with Words Machine Learning Machine learning algorithms Natural Language Natural languages Randomization Speech synthesis Synthesizers Testing Translation |
title | T2K2: A Type II KASER |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T01%3A02%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=T2K2:%20A%20Type%20II%20KASER&rft.btitle=2006%20IEEE%20International%20Conference%20on%20Information%20Reuse%20&%20Integration&rft.au=Rubin,%20S.H.&rft.date=2006-09&rft.spage=147&rft.epage=153&rft.pages=147-153&rft.isbn=9780780397880&rft.isbn_list=0780397886&rft_id=info:doi/10.1109/IRI.2006.252404&rft_dat=%3Cieee_6IE%3E4018481%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4018481&rfr_iscdi=true |