Estimating product evolution graph using Kolmogorov complexity
Yasuhiro Hayase, Tetsuya Kanda, Takashi Ishio · 2015
This paper proposes a method of estimating a product evolution graph based on Kolmogorov complexity. The method EEGL applies lossless compression to the source code of products, then, presumes a derivation relationship between two products when the increase of information between the two products is small. An evaluation experiment confirms that EEGL and an existing method PRET tends to produce different errors when estimating evolution graph results.