1. Integrating Class Hierarchies
Yuzhong Qu

2. NJVR 2,996 vocabularies 455,718 terms Instantiation found for
From 261 PLDs (many are from w3.org)
455,718 terms
396,023 classes, 59,868 properties, (many are in YAGO NS)
Instantiation found for
115,707 classes (29.2%), e.g. foaf:Person
25,963 properties (43.4%), e.g. dc:creator
1,874 vocabularies (62.6%)

3. Select Vocabulary Class and property
Instantiated classes //and their ancestors
The amount of instantiation, e.g. k  10 (100?)

4. Instantiated Class Hierarchy

5. Homomorphism
Let M ={S1, S2 ,…} be a partially ordered set (or poset), and so does N= {C1, C2 ,…}
H:MN be a functional relation from M to N (partial?)
Si  Sj  H(Si)  H(Sj)
Note
Merging class hierarchies (taxonomies)
Abstractive summary of a given class hierarchy
|Range H|  K

6. Distance C S H

7. Distance

8. Merge S

9. Summary of instances (class hierarchy)

10. Summary of instances (class hierarchy) ?  OR

11. Instance category and taxonomy
leaf node is weighted

12. Related Problem Huffman Coding Minimum-cost flow problem
(Directed) Steiner Tree
Node-weighted Steiner Tree
(Weighted)Vertex Cover
(Weighted) Dominating Set
Maximum coverage problem (select no more than K sets)
Weighted version (elements are weighted)
Minimum Set Cover
Weighted version (sets are weighted)

13. Huffman Coding (Minimum weighted path length)
Huffman D A. A method for the construction of minimum-redundancy
codes. Proceedings of the IRE, 1952, 40(9):

14. Minimum-cost flow problem
Given a directed graph with source s and sink t, where each edge (u,v) has capacity c(u, v), flow  f(u, v),  and cost  a(u, v). You are required to send an amount of flow d from s to t.
Minimize

15. Minimum Steiner Tree
Given a set V of points (vertices), interconnect them by a network (graph) of shortest length, where the length is the sum of the lengths of all edges.

16. Minimum Steiner Tree
Given an edge-weighted graph G = (V, E, w) and a subset S ⊆ V of required vertices.
A Steiner tree is a tree in G that spans all vertices of S. The task is to find a minimum-weight Steiner tree.

17. Dominating Set problem
A dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D.
The minimum dominating set is NP-hard
Its decision version is a classical NP-complete decision problem  
the problem is not fixed-parameter tractable in the sense that no algorithm with running time f(k)nO(1) for any function f exists unless the W-hierarchy collapses to FPT=W[2].
if the input graph is planar, the problem remains NP-hard, but a fixed-parameter algorithm is known.

18. Vertex Cover problem
A vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set.
The minimum vertex cover is NP-hard
Its decision version, the vertex cover problem, was one of Karp's 21 NP-complete problems 
“if G has a vertex cover of k vertices” is fixed-parameter tractable
O(kn k)

19. Other Techniques
Graph summarization
Graph edit distance

20. Reference (Minimum cost flow)
James B. Orlin. A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming. 1997(78): 109–129.

21. Reference (Steiner Tree)
Klein P, Ravi R. A nearly best-possible approximation algorithm for node-weighted Steiner trees. Journal of Algorithms, 1995, 19(1):
Zelikovsky A. A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica, 1997, 18(1):
Charikar M, Chekuri C, Cheung T, et al. Approximation algorithms for directed Steiner problems. Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms. 1998:
Zosin L, Khuller S. On directed Steiner trees. Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. 2002:

22. Reference (Vertex Cover)
Niedermeier R, Rossmanith P. On efficient fixed-parameter algorithms for weighted vertex cover. Journal of Algorithms, 2003, 47(2):
White L J, Gillenson M L. An efficient algorithm for minimum k-covers in weighted graphs. Mathematical Programming, 1975, 8(1):
Chen J, Kanj I A, Xia G. Improved parameterized upper bounds for vertex cover. Mathematical Foundations of Computer Science Springer Berlin Heidelberg, 2006:

23. Reference (Graph Summarization)
Navlakha S, Rastogi R, Shrivastava N. Graph summarization with bounded error. Proceedings of the 2008 ACM SIGMOD international conference on Management of data. ACM, 2008:
Tian Y, Hankins R A, Patel J M. Efficient aggregation for graph summarization. Proceedings of the 2008 ACM SIGMOD international conference on Management of data. ACM, 2008:
Zhang N, Tian Y, Patel J M. Discovery-driven graph summarization. Data Engineering (ICDE), 2010 IEEE 26th International Conference on. IEEE, 2010:
Gao X, Xiao B, Tao D, et al. A survey of graph edit distance. Pattern Analysis and applications, 2010, 13(1):

24. Reference (Document Summarization)
Celikyilmaz A, Hakkani-Tur D. A hybrid hierarchical model for multi-document summarization. ACL 2010:
Shen C, Li T. Multi-document summarization via the minimum dominating set. COLING 2010:

25. Acknowledgement
Q&A
Discussion