-
1
-
-
0002629270
-
Maximum likelihood from incomplete data via the em algorithm
-
Dempster, A. P.; Laird, N. M.; and Rubin, D. B. 1977. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B (Methodological) 39:1-38.
-
(1977)
Journal of the Royal Statistical Society, Series B (Methodological)
, vol.39
, pp. 1-38
-
-
Dempster, A.P.1
Laird, N.M.2
Rubin, D.B.3
-
2
-
-
33750735526
-
-
C & O, AAAI
-
Ding, Z.; Peng, Y.; Pan, R.; and Yu, Y. 2005. A Bayesian Methodology towards Automatic Ontology Mapping. C & O, AAAI.
-
(2005)
A Bayesian Methodology Towards Automatic Ontology Mapping
-
-
Ding, Z.1
Peng, Y.2
Pan, R.3
Yu, Y.4
-
3
-
-
67650319921
-
Learning to map between ontologies on the semantic web
-
ACM Press
-
Doan, A.; Madhavan, J.; Domingos, P.; and Halevy, A. 2002. Learning to map between ontologies on the semantic web. In WWW, 662-673. ACM Press.
-
(2002)
WWW
, pp. 662-673
-
-
Doan, A.1
Madhavan, J.2
Domingos, P.3
Halevy, A.4
-
4
-
-
26444603814
-
Bipartite graphs as intermediate models for rdf graphs
-
Hayes, J., and Gutierrez, C. 2004. Bipartite graphs as intermediate models for rdf graphs. In ISWC.
-
(2004)
ISWC
-
-
Hayes, J.1
Gutierrez, C.2
-
5
-
-
33750233961
-
Gmo: A graph matching for ontologies
-
Hu, W.; Jian, N.; Qu, Y.; and Wang, Y. 2005. Gmo: A graph matching for ontologies. In Integrating Ontologies Wksp., KCAP.
-
(2005)
Integrating Ontologies Wksp., KCAP
-
-
Hu, W.1
Jian, N.2
Qu, Y.3
Wang, Y.4
-
7
-
-
0242308068
-
If-map: An ontology mapping method based on information flow theory
-
Kalfoglou, Y., and Schorlemmer, M. 2003. If-map: an ontology mapping method based on information flow theory. Journal on Data Semantics 1(1):98-127.
-
(2003)
Journal on Data Semantics
, vol.1
, Issue.1
, pp. 98-127
-
-
Kalfoglou, Y.1
Schorlemmer, M.2
-
8
-
-
0035481405
-
Structural graph matching using the em algorithm and singular value decomposition
-
Luo, B., and Hancock, E. 2001. Structural graph matching using the em algorithm and singular value decomposition. Graph Algorithms and Computer Vision 23(10):1120-1136.
-
(2001)
Graph Algorithms and Computer Vision
, vol.23
, Issue.10
, pp. 1120-1136
-
-
Luo, B.1
Hancock, E.2
-
9
-
-
33750737582
-
OMEN: A probabilistic ontology mapping tool
-
Mitra, P.; Noy, N.; and Jaiswal, A. 2004. OMEN: A probabilistic ontology mapping tool. In Meaning, Coord. and Neg., ISWC.
-
(2004)
Meaning, Coord. and Neg., ISWC
-
-
Mitra, P.1
Noy, N.2
Jaiswal, A.3
-
10
-
-
0019887799
-
Identification of common molecular subsequences
-
Smith, T. F., and Waterman, M. S. 1981. Identification of common molecular subsequences. J. of Mol. Biology 147:195-197.
-
(1981)
J. of Mol. Biology
, vol.147
, pp. 195-197
-
-
Smith, T.F.1
Waterman, M.S.2
-
11
-
-
84880894946
-
FCA-MERGE: Bottom-up merging of ontologies
-
Stumme, G., and Maedche, A. 2001. FCA-MERGE: Bottom-up merging of ontologies. In IJCAI, 225-234.
-
(2001)
IJCAI
, pp. 225-234
-
-
Stumme, G.1
Maedche, A.2
|