MiniPalindrome
Saved in:
| Title: | MiniPalindrome |
|---|---|
| Authors: | Paaßen, Benjamin |
| Publisher Information: | Bielefeld University |
| Publication Year: | 2016 |
| Collection: | PUB - Publications at Bielefeld University |
| Subject Terms: | Java programs |
| Description: | Paaßen B. MiniPalindrome . Bielefeld University; 2016. ; This is a dataset of 48 Java computer programs, all solving the same programming task, namely detecting whether all words in the input string are palindromes. The programs have been created by myself in 2012 as part of the DFG funded project _Learning Feedback for Dynamic Tutoring Systems_ (FIT) with grant number HA 2719/6-1. It is meant as a benchmark dataset for methods working on clustering and/or classification of structured data (sequences, trees or graphs). We provide the underlying raw data, as well as an intermediate graph representation and pre-calculated distance matrices. |
| Document Type: | text dataset |
| Language: | unknown |
| Availability: | https://pub.uni-bielefeld.de/record/2900666 https://pub.uni-bielefeld.de/download/2900666/2900682 |
| Rights: | https://opendatacommons.org/licenses/odbl/summary/index.html ; info:eu-repo/semantics/openAccess |
| Accession Number: | edsbas.FBF606DF |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | Paaßen B. MiniPalindrome . Bielefeld University; 2016. ; This is a dataset of 48 Java computer programs, all solving the same programming task, namely detecting whether all words in the input string are palindromes. The programs have been created by myself in 2012 as part of the DFG funded project _Learning Feedback for Dynamic Tutoring Systems_ (FIT) with grant number HA 2719/6-1. It is meant as a benchmark dataset for methods working on clustering and/or classification of structured data (sequences, trees or graphs). We provide the underlying raw data, as well as an intermediate graph representation and pre-calculated distance matrices. |
|---|