Seyed Mohsen Fatemi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Seyed Mohsen Fatemi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ali Kamandi
University of Tehran
2 shared publications - Mahmood Shabankhah
University of Tehran
2 shared publications Ali Kamandi
School of Engineering Science, College of Engineering, University of Tehran,Iran
1 shared publicationAlireza Mahmoudi
School of Engineering Science, College of Engineering, University of Tehran,Iran
1 shared publicationMahmood Shabankhah
School of Engineering Science, College of Engineering, University of Tehran,Iran
1 shared publicationNegar Ohadi
School of Engineering Science, College of Engineering, University of Tehran,Iran
1 shared publication
Latest Publications
- 10 August 2020
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 12 (2) , 365-383
CL-MAX: a clustering-based approximation algorithm for mining maximal frequent itemsets
- 10 August 2020
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 12 (2) , 365-383
CL-MAX: a clustering-based approximation algorithm for mining maximal frequent itemsets
- 1 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 139-145
SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets
Data clustering aims to discover the underlying structure of data. it has many applications in data analysis and it is one of the most widely used tools in data mining. DBSCAN is one of the most famous clustering algorithms. its advantages are to identify clusters of various shapes and define the number of clusters. Since DBSCAN is sensitive to its parameters which are ε and MinPts, it may perform poorly when the dataset is unbalanced. To solve this problem, this paper proposes a sliding window DBSCAN clustering algorithm that uses Gridding and local parameters for unbalanced data which we will refer to as SW-DBSCAN. The algorithm divides the dataset into several grids. The size and shape of each gird depends on the specimen density specification. Then, for each grid, the parameters are adjusted for local clustering and eventually merging data zones. Experimental results show that this algorithm can help to improve the performance of the DBSCAN algorithm and can deal with arbitrary data and asymmetric data.
- 1 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 139-145
SW-DBSCAN: A Grid-based DBSCAN Algorithm for Large Datasets
Data clustering aims to discover the underlying structure of data. it has many applications in data analysis and it is one of the most widely used tools in data mining. DBSCAN is one of the most famous clustering algorithms. its advantages are to identify clusters of various shapes and define the number of clusters. Since DBSCAN is sensitive to its parameters which are ε and MinPts, it may perform poorly when the dataset is unbalanced. To solve this problem, this paper proposes a sliding window DBSCAN clustering algorithm that uses Gridding and local parameters for unbalanced data which we will refer to as SW-DBSCAN. The algorithm divides the dataset into several grids. The size and shape of each gird depends on the specimen density specification. Then, for each grid, the parameters are adjusted for local clustering and eventually merging data zones. Experimental results show that this algorithm can help to improve the performance of the DBSCAN algorithm and can deal with arbitrary data and asymmetric data.
- 29 January 2020
- Published by Springer Nature
- p. 226-237
A Clustering Based Approximate Algorithm for Mining Frequent Itemsets
- 29 January 2020
- Published by Springer Nature
- p. 226-237
A Clustering Based Approximate Algorithm for Mining Frequent Itemsets