In this paper, we define an attributed random graph, which can be considered as a generalization of conventional ones, to include multiple attributes as well as numeric attribute instead of a single nominal attribute in random vertices and edges. Then we derive the probability equations for an attributed graph to be an outcome graph of the attributed random graph, and the equations for the entropy calculation of the attributed random graph. Finally, we propose the application areas to computer vision and machine learning using these concepts.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Dong Su SEONG, Ho Sung KIM, Kyu Ho PARK, "Definition of Attributed Random Graph and Proposal of Its Applications" in IEICE TRANSACTIONS on Information,
vol. E76-D, no. 8, pp. 919-925, August 1993, doi: .
Abstract: In this paper, we define an attributed random graph, which can be considered as a generalization of conventional ones, to include multiple attributes as well as numeric attribute instead of a single nominal attribute in random vertices and edges. Then we derive the probability equations for an attributed graph to be an outcome graph of the attributed random graph, and the equations for the entropy calculation of the attributed random graph. Finally, we propose the application areas to computer vision and machine learning using these concepts.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e76-d_8_919/_p
Copy
@ARTICLE{e76-d_8_919,
author={Dong Su SEONG, Ho Sung KIM, Kyu Ho PARK, },
journal={IEICE TRANSACTIONS on Information},
title={Definition of Attributed Random Graph and Proposal of Its Applications},
year={1993},
volume={E76-D},
number={8},
pages={919-925},
abstract={In this paper, we define an attributed random graph, which can be considered as a generalization of conventional ones, to include multiple attributes as well as numeric attribute instead of a single nominal attribute in random vertices and edges. Then we derive the probability equations for an attributed graph to be an outcome graph of the attributed random graph, and the equations for the entropy calculation of the attributed random graph. Finally, we propose the application areas to computer vision and machine learning using these concepts.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Definition of Attributed Random Graph and Proposal of Its Applications
T2 - IEICE TRANSACTIONS on Information
SP - 919
EP - 925
AU - Dong Su SEONG
AU - Ho Sung KIM
AU - Kyu Ho PARK
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E76-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 1993
AB - In this paper, we define an attributed random graph, which can be considered as a generalization of conventional ones, to include multiple attributes as well as numeric attribute instead of a single nominal attribute in random vertices and edges. Then we derive the probability equations for an attributed graph to be an outcome graph of the attributed random graph, and the equations for the entropy calculation of the attributed random graph. Finally, we propose the application areas to computer vision and machine learning using these concepts.
ER -