Discovering Algorithmic Relationship Between Programming Resources on the Web

DOI

10.2991/iccsee.2013.594How to use a DOI?

Keywords

algorithmic relationship, lobe component analysis, formal concept analysis, programming tutoring, nueral computing

Abstract

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.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Guojin Zhu
AU  - Kai Zhang
AU  - Jiyun Li
PY  - 2013/03
DA  - 2013/03
TI  - Discovering Algorithmic Relationship Between Programming Resources on the Web
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 2373
EP  - 2376
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.594
DO  - 10.2991/iccsee.2013.594
ID  - Zhu2013/03
ER  -