Mostafa Haghir Chehreghani Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostafa Haghir Chehreghani, Morteza Haghir Chehreghani, Caro Lucas, Masoud Rahgozar, Euhanna Ghadimi: Efficient rule based structural algorithms for classification of tree structured data. Intell. Data Anal. 13(1): 165-188 (2009)
2008
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMorteza Haghir Chehreghani, Hassan Abolhassani, Mostafa Haghir Chehreghani: Improving density-based methods for hierarchical clustering of web pages. Data Knowl. Eng. 67(1): 30-50 (2008)
2007
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas, Morteza Haghir Chehreghani: Mining Maximal Embedded Unordered Tree Patterns. CIDM 2007: 437-443
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas, Morteza Haghir Chehreghani: Clustering Rooted Ordered Trees. CIDM 2007: 450-455
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMorteza Haghir Chehreghani, Hassan Abolhassani, Mostafa Haghir Chehreghani: Attaining Higher Quality for Density Based Algorithms. RR 2007: 329-338
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas, Morteza Haghir Chehreghani: A heuristic algorithm for clustering rooted ordered trees. Intell. Data Anal. 11(4): 355-376 (2007)

Coauthor Index

1Hassan Abolhassani [2] [5]
2Morteza Haghir Chehreghani [1] [2] [3] [4] [5] [6]
3Euhanna Ghadimi [6]
4Caro Lucas [1] [3] [4] [6]
5Masoud Rahgozar [1] [3] [4] [6]

Copyright © Tue Dec 1 12:01:14 2009 by Michael Ley (ley@uni-trier.de)