Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Moshkov, Mikhail | Chikalov, Igor
Affiliations: Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia. [email protected] | Faculty of Calculating Mathematics and Cybernetics of Nizhni Novgorod State University 23, Gagarina Av., Nizhni Novgorod, 603600, Russia
Abstract: Upper and lower bounds on minimal average weighted depth and minimal average depth of decision trees over arbitrary information systems are considered. In proofs methods of test theory and rough set theory are used.
Keywords: Information system, decision tree, average weighted depth
DOI: 10.3233/FI-1997-31204
Journal: Fundamenta Informaticae, vol. 31, no. 2, pp. 145-156, 1997
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]