Encoding Knowledge in Tree Structures: to Grow or to Build? Incremental vs. Spiral Algorithms

• Autorzy: Richard Bonner , Violetta Galant
• Języki publikacji: EN

Abstrakty

EN

It practice, when knowledge is being encoded in a tree structure, the tree is often "grown" rather than each time re-constructed from the root as the number of admitted variables increases. This reflects the wishful belief that a myopic procedure of adjoining nodes to a tree, one at a time, should somehow lead to optimal trees in a global sense. We question this belief and formalise the problem of incremental vs. global (spiral) optimisation of tree structures representing given knowledge. Some natural examples show that the problem is not trivial. (original abstract)

Słowa kluczowe

EN

Knowledge; Knowledge management; Conference materials

PL

Wiedza; Zarządzanie wiedzą; Materiały konferencyjne

• Czasopismo: Prace Naukowe Akademii Ekonomicznej we Wrocławiu
• Rocznik: 2000
• Numer: nr 850 Pozyskiwanie wiedzy z baz danych
• Strony: 51--57

Twórcy

autor

Richard Bonner

autor

Violetta Galant

Bibliografia

• Ahlswede, R., and I. Wegener: Search Problems. Wiley. 1987.
• Arabie, P., Hubert, L. J., and G. De Soete, eds.: Clustering and Classification. World Scientific. 1996.
• Baborski, A., ed.: Knowledge Acquisition in Data Bases. Wroclaw University of Economics 1999.
• Berger, J. O.: Statistical Decision Theory and Bayesian Analysis. Springer-Verlag. (1985).
• Billingsley, P.: Ergodic Theory and Information. Wiley. 1965.
• Billingsley, P.: Probability and Measure. Wiley. 1979.
• Bonner, R., Galant, V. and M. Owoc: On features of decision trees in knowledge modelling. In: Ch. Freytag and V. Wolfengagen (Eds.): Proc. CSIT'1999, Moscow. On-line http://msu.jurinfor.ru/CSIT99/BonnerG099.htm
• Bonner, R., and V. Galant: Coding and lattices. In preparation.
• Bonner R.: Financial systems in continuous time. Proc. IFAC'95, Gold Coast, Australia.
• Breiman L. et al: Classification and Regression Trees. Wadsworth 1984.
• Burgisser P., Clausen M., and M. Amin Shokrollahi: Algebraic Complexity Theory. Springer- - Verlag 1997.
• Dudley R.M.: Uniform Central Limit Theorems. Cambridge University Press 1999.
• Edalat A.: Domains for Computation in Mathematics, Physics and Exact Real Arithmetic. Bulletin of Symbolic Logic, 3(4), pp. 401-452, 1997.
• Edalat A.: Domain Theory in learning Processes. Electronic Notes in Theoretical Computer Science 1, 1995.
• Edalat A.: Domain Theory and Integration. Theoretical Computer Science 151, pp. 163-193,1995.
• Fayyad U.M. et al.: Advances in Knowledge Discovery and Data Mining. AAAI Press/MIT Press 1996.
• Fayyad, U., Piatetsky-Shapiro, G., & Smyth, P. (1996). From Data Mining to Knowledge Discovery in Databases. AI Magazine, 17(3), 37. https://doi.org/10.1609/aimag.v17i3.1230.
• Galant V., and Mach M.: Incremental learning algorithms in applications (in Polish). In: Baborski, A., ed.: Knowledge Acquisition in Data Bases. Wroclaw University of Economics 1999.
• Godin R., and Missaoui R.: An incremental concept formation approach for learning from databases. Theoretical Computer Science 133, pp. 387-419, 1994.
• Gruska J.: Quantum Computing, McGraw Hill 1999.
• Marlow A.R. ed.: Mathematical Foundations of Quantum Theory. Academic Press 1978.
• Mislove M.: Generalising domain theory. ETAPS conference in Lisbon in March 1998. (text available at http://bach.math.tulane.edu/misloveiitml)
• Mislove M.: Topology, domain theory and theoretical computer science. Summer Topology Conference in Portland, Maine. (1996) (text available at http://bach.math.tulane.edu/mislove.html).
• Mitchell T.M.: Machine Learning. McGraw-Hill 1989.
• Pless V.S. and Huffman W.: Handbook of Coding Theory. North-Holland 1998.
• Quinlan J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann 1993.
• Quinlan J.R.: Induction of decision trees. Machine Learning, 1(1), pp. 81-106, 1986.
• Shannon C.E.: A mathematical theory of communication. Bell Systems Technical Journal 27, pp. 379-424, 623-657, 1948.
• Sobel M.: Group testing to classify efficiently all defectives in a binomial sample, pp. 127-161 in: Machol, ed.: Information and Decision Processes, McGraw-Hill 1960.
• Steenrod N.E. et al.: How to write mathematicsl Americal Mathematical Society 1973.