CIF: Small: Detection and Classification Problems in Online Information Graphs

CIF：小：在线信息图中的检测和分类问题

• 批准号: 1422193
• 负责人: Rohit Negi
• 金额: $ 40.33万
• 依托单位: Carnegie-Mellon University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2014
• 资助国家: 美国
• 起止时间: 2014-09-01 至 2017-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1422193&HistoricalAwards=false
• 关键词: CIF; Small; Detection; Classification; Problems

Online Social Networks (OSN) such as Facebook, Twitter, as well as a plethora of online datasets, such as Wikipedia and US government?s DATA.GOV initiative are becoming the repositories of knowledge and discussion for the future. These OSNs and online datasets all share the common feature that they can be thought of as ?Online Information Graphs? (OIG), in the sense that the information embedded in them has a natural graph structure, such as Facebook?s graph of ?friends?. This project considers the question of detection and classification of real-world events using these Online Information Graphs from a communication theoretic viewpoint, by using the graph to specify a Bayes prior. As more and more data is made freely available on the internet, utilizing it to extract information becomes important for society, which is the main goal of the project. For example, Open Government data can improve governance, if inferences applicable to society can be made from it.The questions about OIG that are being investigated are; defining and learning suitable models for the Bayes prior of the OIG, defining various detection and classification problems on OIGs, designing detection algorithms for large OIGs, analyzing detector performance, and engineering the information graph to improve detection. The research is partly experimental (e.g., exploring real-world datasets) and partly theoretical (e.g., analyzing detector performance), and so, intellectual contributions will be made in both categories. Algorithms are being designed to operate on these models, for graph structures typical in OSN-type datasets. The research uses analytical techniques from communication theory, adapted to probabilistic graphical models, to predict error performance and to engineer the networks.

Facebook、Twitter 等在线社交网络 (OSN) 以及维基百科和美国政府的 DATA.GOV 计划等大量在线数据集正在成为未来知识和讨论的宝库。这些 OSN 和在线数据集都有一个共同的特征，即它们可以被视为“在线信息图”。 (OIG)，从某种意义上说，其中嵌入的信息具有自然的图结构，例如 Facebook 的“朋友”图。该项目从通信理论的角度考虑使用这些在线信息图来检测和分类现实世界事件的问题，通过使用图来指定贝叶斯先验。随着越来越多的数据在互联网上免费提供，利用它来提取信息对社会变得很重要，这是该项目的主要目标。例如，如果可以从中做出适用于社会的推论，开放政府数据可以改善治理。正在调查的有关监察办的问题是：为 OIG 的贝叶斯先验定义和学习合适的模型，定义 OIG 上的各种检测和分类问题，设计大型 OIG 的检测算法，分析检测器性能，并设计信息图以改进检测。该研究部分是实验性的（例如，探索现实世界的数据集），部分是理论性的（例如，分析探测器性能），因此，将在这两个类别中做出智力贡献。正在设计算法来对这些模型进行操作，以实现 OSN 类型数据集中典型的图形结构。该研究使用通信理论中适用于概率图形模型的分析技术来预测错误性能并设计网络。