P-Tree programming
We propose a novel method for automatic program synthesis. P-Tree Programming represents the program search space through a single probabilistic prototype tree. From this prototype tree we form program instances which we evaluate on a given problem. The error values from the evaluations are propagat...
Uloženo v:
| Vydáno v: | SSCI : 2017 IEEE Symposium Series on Computational Intelligence : November 27, 2017-December 1, 2017 s. 1 - 7 |
|---|---|
| Hlavní autor: | |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.11.2017
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We propose a novel method for automatic program synthesis. P-Tree Programming represents the program search space through a single probabilistic prototype tree. From this prototype tree we form program instances which we evaluate on a given problem. The error values from the evaluations are propagated through the prototype tree. We use them to update the probability distributions that determine the symbol choices of further instances. The iterative method is applied to several symbolic regression benchmarks from the literature. It outperforms standard Genetic Programming to a large extent. Furthermore, it relies on a concise set of parameters which are held constant for all problems. The algorithm can be employed for most of the typical computational intelligence tasks such as classification, automatic program induction, and symbolic regression. |
|---|---|
| AbstractList | We propose a novel method for automatic program synthesis. P-Tree Programming represents the program search space through a single probabilistic prototype tree. From this prototype tree we form program instances which we evaluate on a given problem. The error values from the evaluations are propagated through the prototype tree. We use them to update the probability distributions that determine the symbol choices of further instances. The iterative method is applied to several symbolic regression benchmarks from the literature. It outperforms standard Genetic Programming to a large extent. Furthermore, it relies on a concise set of parameters which are held constant for all problems. The algorithm can be employed for most of the typical computational intelligence tasks such as classification, automatic program induction, and symbolic regression. |
| Author | Oesch, Christian |
| Author_xml | – sequence: 1 givenname: Christian surname: Oesch fullname: Oesch, Christian organization: University of Basel, Switzerland |
| BookMark | eNotjk1Lw0AQQKegoK29eBMv_oHE2Y9MZo8laC0UFJp72ezOlhSTlk0v_nsFe3q3994cbsbTKABPCkul0L3uds2m1KjqkjUjWzeDuaoMk6412TtYTtMREZUjtrW5h8evos0iL-d8OmQ_DP14eIDb5L8nWV65gPb9rW0-iu3netOstkXv8FKYaChUZJ2y5DhYoc5Vxv5FU-Sg0cSYKHQqsU_edxQ8cpKOmLyWKkWzgOd_bS8i-3PuB59_9tdr8wtckjis |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/SSCI.2017.8280849 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) (UW System Shared) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Statistics Computer Science |
| EISBN | 1538627264 9781538627266 |
| EndPage | 7 |
| ExternalDocumentID | 8280849 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ABLEC ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK IEGSK OCL RIE RIL |
| ID | FETCH-LOGICAL-i90t-3d36c564914698c4e6b9534280fd8c203ddf6cb1f8afaab6ca08feb686a2e5fd3 |
| IEDL.DBID | RIE |
| IngestDate | Wed Aug 27 02:51:28 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i90t-3d36c564914698c4e6b9534280fd8c203ddf6cb1f8afaab6ca08feb686a2e5fd3 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_8280849 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-Nov. |
| PublicationDateYYYYMMDD | 2017-11-01 |
| PublicationDate_xml | – month: 11 year: 2017 text: 2017-Nov. |
| PublicationDecade | 2010 |
| PublicationTitle | SSCI : 2017 IEEE Symposium Series on Computational Intelligence : November 27, 2017-December 1, 2017 |
| PublicationTitleAbbrev | SSCI |
| PublicationYear | 2017 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0001968473 |
| Score | 1.6440383 |
| Snippet | We propose a novel method for automatic program synthesis. P-Tree Programming represents the program search space through a single probabilistic prototype... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Benchmark testing Open area test sites Probability distribution Programming Prototypes Sociology Statistics |
| Title | P-Tree programming |
| URI | https://ieeexplore.ieee.org/document/8280849 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LawIxEB5UevBkfZS-2UOPjcZNNo-zVNqLLOjBm-QxgR6qRbS_v8nuVin00lsIM4RJyGMm880H8KSo0TSgJNJSRrgQnlhVOBI3h3dO0uDRVmQTcrFQ67UuW_B8wsIgYpV8huPUrP7y_c4dU6hsEr0DqrhuQ1tKUWO1zvEULeJBy5qPyynVk-Vy9pZyt-S40ftFoFLdH_Pe_0a-hNEZiJeVpyumDy3cDqD3w8SQNRtzAN30ZqxLLg-hX5LVHjFrUq8-ouYIVvOX1eyVNNQH5F3TA2GeCVcIrqeJ4NFxFFYXLHoKce6UyynzPghnp0GZYIwVzlAV0AolTI5F8OwKOtvdFq8hY1YrE8W8LDyPwspyF7jPdcg9tcrdwDCZu_msi1tsGktv_-6-g26a0RqMdw-dw_6ID3DhvqKN-8dqRb4Bj0qNTw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LawIxEB6sLdST9VH67h56bDRustnkLBWlVgT34E02yQR6qBbR_v4mu1ul0EtvIcwQJiGPmcw3H8CTpLmiDlOSasoIF8ISLRND_OawxqTUWdQF2UQ6m8nlUs1r8HzAwiBikXyGvdAs_vLtxuxDqKzvvQMquTqB04TzmJZorWNERQl_1LLq63JAVX-xGE5C9lbaqzR_UagUN8io-b-xL6B7hOJF88Ml04IartvQ_OFiiKqt2YZGeDWWRZc70JqTbIsYVclXH16zC9noJRuOSUV-QN4V3RFmmTCJ4GoQKB4NR6FVwryv4GdPmpgya50weuBk7vJcC5NT6VALKfIYE2fZJdTXmzVeQcS0krkXs2liuReWmhvHbaxcbKmW5ho6wdzVZ1neYlVZevN39yOcj7O36Wo6mb3eQiPMbgnNu4P6brvHezgzX97e7UOxOt8clJCW |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=SSCI+%3A+2017+IEEE+Symposium+Series+on+Computational+Intelligence+%3A+November+27%2C+2017-December+1%2C+2017&rft.atitle=P-Tree+programming&rft.au=Oesch%2C+Christian&rft.date=2017-11-01&rft.pub=IEEE&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FSSCI.2017.8280849&rft.externalDocID=8280849 |