TY - GEN
T1 - Object-Oriented Data Flow Diagram Similarity Measurement Using Greedy Algorithm
AU - Irhamn, Firli
AU - Siahaan, Daniel
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/8
Y1 - 2019/8
N2 - Measuring software similarity base on software design artifacts has been one of the research topics in software engineering. Software similarity measurement is used in software reuse, clone detection, and learning assessment. Previous research focus on universal modeling language design artifacts. These design artifacts concern on the semantic and structure of a set of objects within a system and their interaction with themselves and objects outside the system. There are also design artifacts that model how data or information transformed into different forms, sizes, and time. This study focus on developing diagram similarity measurement base on one of those artifacts, i.e., object-oriented data flow diagrams. The measurement uses the greedy approach to calculate the similarity score of two diagrams using four elements derived from elements of object oriented data flow diagram, i.e. external entities, processes, data stores, and classes. The initial experimentation result shows that the proposed diagram similarity measurement is feasible.
AB - Measuring software similarity base on software design artifacts has been one of the research topics in software engineering. Software similarity measurement is used in software reuse, clone detection, and learning assessment. Previous research focus on universal modeling language design artifacts. These design artifacts concern on the semantic and structure of a set of objects within a system and their interaction with themselves and objects outside the system. There are also design artifacts that model how data or information transformed into different forms, sizes, and time. This study focus on developing diagram similarity measurement base on one of those artifacts, i.e., object-oriented data flow diagrams. The measurement uses the greedy approach to calculate the similarity score of two diagrams using four elements derived from elements of object oriented data flow diagram, i.e. external entities, processes, data stores, and classes. The initial experimentation result shows that the proposed diagram similarity measurement is feasible.
KW - diagram similarity measurement
KW - greedy algorithm
KW - object-oriented data flow diagram
UR - http://www.scopus.com/inward/record.url?scp=85074413378&partnerID=8YFLogxK
U2 - 10.1109/ICORIS.2019.8874895
DO - 10.1109/ICORIS.2019.8874895
M3 - Conference contribution
AN - SCOPUS:85074413378
T3 - 2019 1st International Conference on Cybernetics and Intelligent System, ICORIS 2019
SP - 274
EP - 278
BT - 2019 1st International Conference on Cybernetics and Intelligent System, ICORIS 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1st International Conference on Cybernetics and Intelligent System, ICORIS 2019
Y2 - 22 August 2019 through 23 August 2019
ER -