Nowadays, increasingly more data are available as knowledge graphs (KGs). While this data model supports advanced reasoning and querying, they remain difficult to mine due to their size and complexity. Graph mining approaches can be used to extract patterns from KGs. However this presents two main issues. First, graph mining approaches tend to extract too many patterns for a human analyst to interpret (pattern explosion). Second, real-life KGs tend to differ from the graphs usually treated in graph mining: they are multigraphs, their vertex degrees tend to follow a power-law, and the way in which they model knowledge can produce spurious patterns. Recently, a graph mining approach named GraphMDL+ has been proposed to tackle the problem of pattern explosion, using the Minimum Description Length (MDL) principle. However, GraphMDL+, like other graph mining approaches, is not suited for KGs without adaptations. In this paper we propose KG-MDL, a graph pattern mining approach based on the MDL principle that, given a KG, generates a human-sized and descriptive set of graph patterns, and so in a parameter-less and anytime way. We report on experiments on medium-sized KGs showing that our approach generates sets of patterns that are both small enough to be interpreted by humans and descriptive of the KG. We show that the extracted patterns highlight relevant characteristics of the data: both of the schema used to create the data, and of the concrete facts it contains. We also discuss the issues related to mining graph patterns on knowledge graphs, as opposed to other types of graph data.
Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets
Université de Lorraine(洛林大学);CNRS(法国国家科学研究中心);Inria(法国国家信息与自动化研究所);LORIA(洛林信息学及其应用研究实验室);National Research University Higher School of Economics(高等经济大学)
A Geometrically-Grounded Drive for MDL-Based Optimization in Deep Learning
School of Aeronautics and Astronautics, Shanghai JiaoTong University, Shanghai China(上海交通大学航空航天学院);M´ et´ eo-France/CNRS CNRM/GAMEUMR 3589 and the Mathematical Institute of Toulouse, France(法国Météo-France/CNRS CNRM/GAMEUMR 3589和图卢兹数学研究所)
Categorical anomaly detection in heterogeneous data using minimum description length clustering
University of Edinburgh(爱丁堡大学);The Alan Turing Institute(艾伦·图灵研究所);Polytechnic University of Catalonia(加泰罗尼亚理工大学);King’s College, London(伦敦国王学院);New York University(纽约大学)
AlphaPROBE: Alpha Mining via Principled Retrieval and On-graph biased evolution
National Key Laboratory for Multimedia Information Processing, School of Computer Science, PKU-Anker LLM Lab, Peking University(国家多媒体信息处理重点实验室,计算机科学学院,PKU-Anker LLM实验室,北京大学);Institute for Artificial Intelligence, Peking University(人工智能研究院,北京大学);Baruch College, City University of New York(巴纳克学院,纽约城市大学)