A heuristic algorithm for clustering rooted ordered trees-Reference-Cited by-同舟云学术

A heuristic algorithm for clustering rooted ordered trees

Published:2007-07-30 Issue:4 Volume:11 Page:355-376
ISSN:1571-4128
Container-title:Intelligent Data Analysis
language:
Short-container-title:IDA

Author:

Chehreghani Mostafa Haghir¹,Rahgozar Masoud²,Lucas Caro²,Chehreghani Morteza Haghir³

Affiliation:

1. Database Research Group, Faculty of ECE, School of Engineering, University of Tehran, Tehran, Iran. E-mail: m.haghir@ece.ut.ac.ir

2. Database Research Group, Control and Intelligent Processing Center Of Excellence, Faculty of ECE, School of Engineering, University of Tehran, Tehran, Iran. E-mail: rahgozar@ut.ac.ir; lucas@ipm.ir

3. Department of CE, Sharif University of Technology, Tehran, Iran. E-mail: haghir@ce.sharif.edu

Publisher

IOS Press

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Theoretical Computer Science

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SOFTWARE-RELATED PRODUCT HARM CRISIS: ANALYZING CODING SCHEMES TO DEVELOP MANAGEMENT FRAMEWORK (SR-PHC-MF);International Journal of Innovations & Research Analysis;2023-12-31

2. A Deep Learning Framework for Generation and Analysis of Driving Scenario Trajectories;SN Computer Science;2023-03-04

3. On the theory of dynamic graph regression problem;Computational and Applied Mathematics;2022-10-23

4. Sublinear update time randomized algorithms for dynamic graph regression;Applied Mathematics and Computation;2021-12

5. Creating Process-Agents incrementally by mining process asset library;Information Sciences;2013-06