ViBR: Visualizing Bipartite Relations at Scale with the Minimum Description Length Principle
論文傳送門 作者 紐約大學： Gromit Yeuk-Yin 博世北美研究中心 Panpan Xu Zeng Dai Liu Ren 摘要： 二部圖模擬了許多真實世界中大規模的關鍵關係，比如顧客購買商品，立法者投票、人與不同社會羣體的聯繫，車輛發生故障等等。然而，對具有成千上萬甚至更多節點或邊的二部圖進行可視化是非常有挑戰的。在本文中，我們提出了一種基於最小描述長度（MDL）的新的視覺摘要技術。該
相關文章
- 1. some understanding of《Inferring Decision Trees Using the Minimum Description Length Principle*》
- 2. Learning with Privacy at Scale
- 3. Tree - XGBoost with parameter description
- 4. Running Kafka At Scale
- 5. Winglets: Visualizing Association with Uncertainty in Multi-class Scatterplots
- 6. THE GOLDILOCKS PRINCIPLE: READING CHILDREN’S BOOKS WITH EXPLICIT
- 7. Dealing with Scale in AR
- 8. The Maximum Entropy Principle
- 9. The MegaFace Benchmark-1 Million Faces for Recognition at Scale
- 10. Visualizing an Assassin Puzzle
- 更多相關文章...
- • XML DOM length 屬性 - XML DOM 教程
- • XML DOM length 屬性 - XML DOM 教程
- • 爲了進字節跳動，我精選了29道Java經典算法題，帶詳細講解
- • Java 8 Stream 教程
相關標籤/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
歡迎關注本站公眾號,獲取更多信息
相關文章
- 1. some understanding of《Inferring Decision Trees Using the Minimum Description Length Principle*》
- 2. Learning with Privacy at Scale
- 3. Tree - XGBoost with parameter description
- 4. Running Kafka At Scale
- 5. Winglets: Visualizing Association with Uncertainty in Multi-class Scatterplots
- 6. THE GOLDILOCKS PRINCIPLE: READING CHILDREN’S BOOKS WITH EXPLICIT
- 7. Dealing with Scale in AR
- 8. The Maximum Entropy Principle
- 9. The MegaFace Benchmark-1 Million Faces for Recognition at Scale
- 10. Visualizing an Assassin Puzzle