Discovering Algorithmic Relationship between Programming Resources on the Web
| Autor: | Guo Jin Zhu, Ji Yun Li, Kai Zhang |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Source code
Theoretical computer science Artificial neural network business.industry Computer science media_common.quotation_subject Algorithmic learning theory ComputerApplications_COMPUTERSINOTHERSYSTEMS General Medicine World Wide Web Tree structure Simple (abstract algebra) Formal concept analysis Artificial intelligence Algorithmic game theory business media_common |
| Zdroj: | Applied Mechanics and Materials. :2430-2435 |
| ISSN: | 1662-7482 |
| DOI: | 10.4028/www.scientific.net/amm.347-350.2430 |
| Popis: | Algorithmic relationships are discovered here for programming tutoring. There are two kinds of algorithmic relationships between programming resources on the web: associative relationship and structural similarity relationship. They can be organized as a hierarchical body. An algorithm can solve different programming problems and a programming problem also can be solved by different algorithms. Thus, there is such algorithmic relationship, or associative relationship, between these programming resources on the web. The algorithmic structures of source codes can be mined by neural computing. Different source codes may have a structural similarity relationship between them, meaning that they are similar in their algorithmic structures. A learner can learn algorithms from simple to complicated structures or from similarities in their structures. In our experiment, we use a tree structure to organize the algorithmic relationships. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|