一个层次结构用户兴趣模型是一个以单个兴趣向量为节点的树。
A hierarchical user interest model is a tree whose nodes are the single interest vectors.
该算法以节点间的传输时间向量为输入，借助能够体现网络拓扑结构局部信息的核局部保持映射进行建模。
The algorithm took transmission time vector between nodes as input, and a model was established by KLPP, which can reflect partial information network topology structure.
该算法以节点间的传输时间向量为输入，借助能够体现网络拓扑结构局部信息的核局部保持映射进行建模。
The algorithm took transmission time vector between nodes as input, and a model was established by KLPP, which can reflect partial information network topology structure.
应用推荐