Title:
GENERALIZATION METHOD AND DEVICE FOR ATTRIBUTE-CLASS RELATION
Document Type and Number:
Japanese Patent JP3333802
Kind Code:
B2
Abstract:
PROBLEM TO BE SOLVED: To provide a method to uniquely and completely control leaves and also to acquire a set of nodes that has the best evaluation value.
SOLUTION: When an attribute-class relation is generalized, the data on a relation table showing a relation between the attributes and classes are connected to a tree or a forest (1). The evaluation value is given to every node of the connected tree or forest based on the evaluation function that previously given (2). Then the position numbers of the right and left edge leaves which are controlled by every node of the tree or forest are given to these nodes (3). The sides are stuck among an independent start node, every node and an independent end node based on the control relations of nodes and the connection conditions of these control relations, so that a graph is produced (4). Furthermore, a path where a set of nodes existing on a path reaching the end node from the start node via the side of the graph control uniquely and completely all leaves and the total evaluation value of these nodes is minimized is acquired (5).
Inventors:
Hideki Tanaka
Akimasa Ehara
Akimasa Ehara
Application Number:
JP17177095A
Publication Date:
October 15, 2002
Filing Date:
July 07, 1995
Export Citation:
Assignee:
Japan Broadcasting Corporation
International Classes:
G06F17/27; G06F17/30; (IPC1-7): G06F17/27
Other References:
【文献】田中英輝,木構造上の最適一般化を求める線形時間アルゴリズム,1995年度人工知能学会全国大会(第9回)論文集,日本,1995年 7月24日,p.85-p.88
Attorney, Agent or Firm:
Akihide Sugimura (5 outside)
Previous Patent: REARRANGING TOOL FOR EXCESSIVE LENGTH OF COATED OPTICAL FIBER
Next Patent: DIESEL ENGINE FOR ENGINE GENERATOR
Next Patent: DIESEL ENGINE FOR ENGINE GENERATOR