图 书 馆开课单位--伊利诺伊大学
51
52
53
51Semidefinite ranking on graphs[图表上的半定列排名]
Shankar Vembu(伊利诺伊大学) We consider the problem of ranking the vertices of an undirected graph given some preference relation. This ranking on graphs problem has been tackled...
热度：33
Shankar Vembu(伊利诺伊大学) We consider the problem of ranking the vertices of an undirected graph given some preference relation. This ranking on graphs problem has been tackled...
热度：33
52Frequent graph mining - what is the question?[频繁图挖掘的问题是什么？]
Gyorgy Turan(伊利诺伊大学) The objective of data mining is to find regularities, or interesting patterns in large data sets, such as business transactions. More recently, there ...
热度：101
Gyorgy Turan(伊利诺伊大学) The objective of data mining is to find regularities, or interesting patterns in large data sets, such as business transactions. More recently, there ...
热度：101
53Automatic Labeling of Multinomial Topic Models[多项主题模型的自动标注]
Qiaozhu Mei(伊利诺伊大学) Multinomial distributions over words are frequently used to model topics in text collections. A common, major challenge in applying all such topic mod...
热度：85
Qiaozhu Mei(伊利诺伊大学) Multinomial distributions over words are frequently used to model topics in text collections. A common, major challenge in applying all such topic mod...
热度：85