A NEW CLUSTERING ALGORITHM IN CATEGORICAL DATA APPROACH

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NABILOO MARYAM; Daneshpour Negin

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT) Year:2016 | Volume:4 | Issue:4 Page(s): 14-30

Download Full-Text

Persian Verion

View:

1,940

Download:

Cites:

Information Journal Paper

Title

A NEW CLUSTERING ALGORITHM IN CATEGORICAL DATA APPROACH

Author(s)

NABILOO MARYAM | Daneshpour Negin | Issue Writer Certificate

Keywords

DATA MININGQ2

CLUSTERINGQ2

CATEGORICAL DATAQ2

K-MODES CLUSTERINGQ2

HIERARCHICAL CLUSTERINGQ2

Abstract

Data CLUSTERING is a basic tool for understanding the structure of data collections. The process puts the data into groups of similar objects is called CLUSTERING. CLUSTERING is one of the main issues of unsupervised CLUSTERING to find the structure in a set of unlabeled data. CLUSTERING algorithms can be divided into two categories according to the type of data: CLUSTERING algorithms for numerical data and CLUSTERING algorithms for CATEGORICAL DATA. The CLUSTERING algorithms for CATEGORICAL DATA are more important than CLUSTERING algorithms for numerical data because of the nature and application of these data. In this paper, at first the nature of this type of data is described and then the CLUSTERING algorithms and similarity measures presented in this area are reviewed. Finally, a hybrid method is proposed based on the combination of the hierarchical CLUSTERING algorithm and the partitioning CLUSTERING algorithm. The experiments show that the proposed method in this paper improves the results of CLUSTERING.

Cites

No record.

References

No record.

Cite

APA: Copy

NABILOO, MARYAM, & Daneshpour, Negin. (2016). A NEW CLUSTERING ALGORITHM IN CATEGORICAL DATA APPROACH. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), 4(4), 14-30. SID. https://sid.ir/paper/245873/en

Vancouver: Copy

NABILOO MARYAM, Daneshpour Negin. A NEW CLUSTERING ALGORITHM IN CATEGORICAL DATA APPROACH. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT)[Internet]. 2016;4(4):14-30. Available from: https://sid.ir/paper/245873/en

IEEE: Copy

MARYAM NABILOO, and Negin Daneshpour, “A NEW CLUSTERING ALGORITHM IN CATEGORICAL DATA APPROACH,” JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), vol. 4, no. 4, pp. 14–30, 2016, [Online]. Available: https://sid.ir/paper/245873/en

Related Journal Papers