发明授权
- 专利标题: User preference modeling method using fuzzy networks
- 专利标题(中): 使用模糊网络的用户偏好建模方法
-
申请号: US09301317申请日: 1999-04-29
-
公开(公告)号: US06338051B1公开(公告)日: 2002-01-08
- 发明人: Ho-seok Kang , Sun-wha Chung , Kwang-hyung Lee , Joo-young Yoon , Kyoung-a Sung
- 申请人: Ho-seok Kang , Sun-wha Chung , Kwang-hyung Lee , Joo-young Yoon , Kyoung-a Sung
- 优先权: KR98-15521 19980430
- 主分类号: G06F1518
- IPC分类号: G06F1518
摘要:
A user preference modeling method using fuzzy networks. The user preference modeling method includes the steps of: (a) changing a user modeling structure into a fuzzy network structure in which a plurality of layers including one or more graphs with one or more nodes are stacked; (b) when information is input from a user, searching a node directly associated with the input information on the fuzzy networks, and calculating a new preference for the node with a predetermined equation; (c) calculating connection strengths among each node in a graph to which the node belongs according to the new preference obtained in step (b) and calculating a new preference for each node of the graph according to the connection strengths; (d) when a node of the graph to which the node searched in step (b) belongs is a macro node of a graph of a lower layer, and a node is defined as the macro node if a graph of a lower layer defines sub-regions of the node, transferring a first message as preference change information from the macro node to the graph of the lower layer; (e) when the graph to which the node searched in step (b) belongs has a macro node in an upper layer, transferring a second message to the macro node, as preference change information for all nodes of the graph to which the node belongs; (f) when a graph receives the first message from a macro node, calculating a new preference for all nodes in the graph that has received the first message, and when a node of the graph that has received the first message is a macro node of a graph of a lower layer, transferring a first message as preference change information to the graph of the lower layer; and (g) when a node receives the second message from a graph of a lower layer, calculating a new preference for the node that has received the second message and performing steps (c) through (e) to other nodes.