On the generating process and the class typicality measure
| dc.contributor.author | Golubitsky, Oleg | |
| dc.date.accessioned | 2023-03-01T18:30:11Z | |
| dc.date.available | 2023-03-01T18:30:11Z | |
| dc.date.issued | 2002 | |
| dc.description.abstract | In this paper, we consider the stochastic generating process—one of the key concepts of the Evolving Transformation System model [1]—from the formal perspective. First, we give an informal definition of the generating process supported by some intuitive assumptions and consider several examples. Then, we formally define the concept of the generating process as a continuous parameter (c.p.) Markov chain. Some important random variables associated with this c.p. Markov chain are introduced next, followed by the definition of the typicality measure. Two methods for the computation of the typicality measure are proposed. In conclusion, we discuss the problem of compactification of the state space for the c.p. Markov chain. This problem is not only interesting from the points of view of topology and of the c.p. Markov chains theory, but also has important implications for the ETS model, since it is related to the problem of class comparison and to the proper formulation of the learning problem. Reference: [1] L. Goldfarb, O. Golubitsky, D. Korkin, What is a structural representation? Technical Report TR00-137, Faculty of Computer Science, U.N.B., October 2001. | |
| dc.description.copyright | Copyright @ Oleg Golubitsky, 2002. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14977 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | On the generating process and the class typicality measure | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1