DOMAIN KNOWLEDGE GUIDED SELECTION OF NODES FOR ADDITION TO DATA TREES

A computing server may continuously update a set of nodes that are addable to a data tree based on past interactions of the user with one or more nodes. The computing server may track a recently interacted set of interacted nodes with which the user has interacted within a number of past interaction...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Yu, Yen-Yun, Zhang, Xiaoxuan, Zhang, Sijia
Format:	Patent
Sprache:	eng
Schlagworte:	CALCULATING COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A computing server may continuously update a set of nodes that are addable to a data tree based on past interactions of the user with one or more nodes. The computing server may track a recently interacted set of interacted nodes with which the user has interacted within a number of past interactions. The computing server may select a pool of candidate nodes based on the recently interacted set. At least one of the candidate nodes is within a domain boundary of one of the interacted nodes that is in the recently interacted set. The domain boundary may be determined by the degree of relationship. The computing server may present one or more candidate nodes in the pool as a version of the continuously updated set of nodes. The computing server may update the pool of candidate nodes as additional interactions performed by the user updates the recently interacted set.