✦ LIBER ✦

A new dissimilarity measure for comparing labeled graphs

✍ Scribed by Wicker, Nicolas; Nguyen, Canh Hao; Mamitsuka, Hiroshi

Book ID: 119992402
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 324 KB
Volume: 438
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.10.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimized dissimilarity space embedding

✍ Livi, Lorenzo; Rizzi, Antonello; Sadeghian, Alireza 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 774 KB

Symbolic clustering using a new dissimil

Symbolic clustering using a new dissimilarity measure

✍ K. Chidananda Gowda; E. Diday 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 833 KB

EM-type method for measuring graph dissi

EM-type method for measuring graph dissimilarity

✍ Chen, Lifei 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 552 KB

New dissimilarity measure for recognizin

✍ Hisashi Koga; Hiroaki Saito; Toshinori Watanabe; Takanori Yokoyama 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

Tree is a data structure used to express various objects such as semistructured data and genes. When objects are represented as trees, computing tree similarity is essential for pattern recognition and retrieval. This paper considers the noisy subsequence tree recognition problem whose purpose is to

A new graceful labeling for pendant grap

A new graceful labeling for pendant graphs

✍ Graf, Alessandra 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 784 KB

A dissimilarity measure for the k-Modes

✍ Fuyuan Cao; Jiye Liang; Deyu Li; Liang Bai; Chuangyin Dang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 298 KB