Author of the publication

Improving the Efficiency of the K-medoids Clustering Algorithm by Getting Initial Medoids.

, , , , , , and . WorldCIST (1), volume 569 of Advances in Intelligent Systems and Computing, page 125-132. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Vertical Fragmentation Design of Distributed Databases Considering the Nonlinear Nature of Roundtrip Response Time., , , and . KES (2), volume 6277 of Lecture Notes in Computer Science, page 173-182. Springer, (2010)Improving the Efficiency and Efficacy of the K-means Clustering Algorithm Through a New Convergence Condition., , , , , and . ICCSA (3), volume 4707 of Lecture Notes in Computer Science, page 674-682. Springer, (2007)A New Criterion for Improving Convergence of Fuzzy C-Means Clustering., , , , , , and . Axioms, 13 (1): 35 (January 2024)Early Classification: A New Heuristic to Improve the Classification Step of K-Means., , , , and . J. Inf. Data Manag., 4 (2): 94-103 (2013)An Efficient Heuristic Applied to the K-means Algorithm for the Clustering of Large Highly-Grouped Instances., , , , , , and . Computación y Sistemas, (2018)Time Series Complexities and Their Relationship to Forecasting Performance., , , , and . Entropy, 22 (1): 89 (2020)The Hybrid Forecasting Method SVR-ESAR for Covid-19., , , , , , and . Int. J. Comb. Optim. Probl. Informatics, 12 (1): 42-48 (2021)Minimizing roundtrip response time in distributed databases with vertical fragmentation., , , , and . J. Comput. Appl. Math., (2014)Design of a Shared Ontology Used for Translating Negotiation Primitives., , , , , , and . ICCSA (4), volume 3983 of Lecture Notes in Computer Science, page 169-178. Springer, (2006)Survey of polynomial transformations between NP-complete problems., , , , , , , and . J. Comput. Appl. Math., 235 (16): 4851-4865 (2011)