目录
TSD-CRP模型：时空相关的中国餐馆过程模型的基于Gibbs采样的求解 dd-CRP模型基于search的求解过程 用户选择算法 用户博弈模拟 LDA EM algorithm by JAVA Network Formation in the Presence of Contagious Risk
用户博弈模拟
户博弈模拟，可进行事件、用户、收益设置。
LDA EM algorithm by JAVA
The Java version of LDA model inferring by EM algorithm.
Network Formation in the Presence of Contagious Risk
Here we formulate the problem in terms of strategic network formation, and
provide asymptotically tight bounds on the welfare of both optimal and stable networks. We find that socially optimal networks are, in a precise sense, situated just beyond a phase transition in the behavior of the cascading failures, and that stable graphs lie slightly further beyond this phase transition, at a point where most of the available welfare has been lost. Our analysis enables us to explore such issues as the trade-offs between clustered and anonymous market structures, and it exposes a fundamental sense in which very small amounts of “over-linking” in networks with contagious risk can have strong consequences for the welfare of the participants. -论文：L. Blume, D. Easley, J. Kleinberg, R. Kleinberg, E. Tardos. Network Formation in the Presence of Contagious Risk. Proc. 12th
dd-CRP模型基于search的求解过程
基于A-star搜索的dd-CRP模型的快速求解，相对于传统的基于Gibbs采样
的模型求解算法，此方法可以大大提高模型求解的速度。 输入文件是：
1）文本数据；
输出文件： 1）话题参数； 2）每个文本所属的话题。
用户选择算法
使用Kmeans聚类算法对用户进行聚类，实现用户选择。
ACM Conference on Electronic Commerce, 2011.
TSD-CRP模型：时空相关的中国餐馆过程模 型的基于Gibbs采样的求解
TSD-CRP模型：时空相关的中国餐馆过程模型的基于Gibbs采样的求解 此模型的输入文件，包括： 1）网络结构数据； 2）用户产生的文本，包括时间信息。 输出文件是： 1）挖掘出来的话题参数； 2）用户文件所属的话题。