The adoption of knowledge graphs is growing across various domains. And their construction, when automated, can result in verbose sparse graphs. In this talk, we discuss how to mine frequent patterns and subgraphs in a calculation knowledge graph in order to factor out verbose representations and allow for each of maintenance, reduction of storage, and an increase in runtime speed.