Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (444)
  • Open Access

    ARTICLE

    An Improved Crow Search Based Intuitionistic Fuzzy Clustering Algorithm for Healthcare Applications

    Parvathavarthini S1,*, Karthikeyani Visalakshi N2, Shanthi S3, Madhan Mohan J4

    Intelligent Automation & Soft Computing, Vol.26, No.2, pp. 253-260, 2020, DOI:10.31209/2019.100000155

    Abstract Intuitionistic fuzzy clustering allows the uncertainties in data to be represented more precisely. Medical data usually possess a high degree of uncertainty and serve as the right candidate to be represented as Intuitionistic fuzzy sets. However, the selection of initial centroids plays a crucial role in determining the resulting cluster structure. Crow search algorithm is hybridized with Intuitionistic fuzzy C-means to attain better results than the existing hybrid algorithms. Still, the performance of the algorithm needs improvement with respect to the objective function and cluster indices especially with internal indices. In order to address these issues, the crow search algorithm… More >

  • Open Access

    ARTICLE

    Personalized Nutrition Recommendation for Diabetic Patients Using Optimization Techniques

    Bhavithra Janakiraman1,*, Saradha Arumugam2

    Intelligent Automation & Soft Computing, Vol.26, No.2, pp. 269-280, 2020, DOI:10.31209/2019.100000150

    Abstract Personalization in recommendation system has been emerging as the most predominant area in service computing. Collaborative filtering and content based approaches are two major techniques applied for recommendation. However, to improve the accuracy and enhance user satisfaction, optimization techniques such as Ant Colony and Particle Swarm Optimization were analyzed in this paper. For theoretical analysis, this paper investigates web page recommender system. For experimentation, Diabetic patient’s health records were investigated and recommendation algorithms are applied to suggest appropriate nutrition for improving their health. Experiment result shows that Particle Swarm Optimization outperforms other traditional methods with improved performance and accuracy. More >

  • Open Access

    ARTICLE

    Color Image Segmentation Using Soft Rough Fuzzy-C-Means and Local Binary Pattern

    R.V.V. Krishna1,*, S. Srinivas Kumar2

    Intelligent Automation & Soft Computing, Vol.26, No.2, pp. 281-290, 2020, DOI:10.31209/2019.100000121

    Abstract In this paper, a color image segmentation algorithm is proposed by extracting both texture and color features and applying them to the one -against-all multi class support vector machine (MSVM) classifier for segmentation. Local Binary Pattern is used for extracting the textural features and L*a*b color model is used for obtaining the color features. The MSVM is trained using the samples obtained from a novel soft rough fuzzy c-means (SRFCM) clustering. The fuzzy set based membership functions capably handle the problem of overlapping clusters. The lower and upper approximation concepts of rough sets deal well with uncertainty, vagueness, and incompleteness… More >

  • Open Access

    ARTICLE

    Quantum Hierarchical Agglomerative Clustering Based on One Dimension Discrete Quantum Walk with Single-Point Phase Defects

    Gongde Guo1, Kai Yu1, Hui Wang2, Song Lin1, *, Yongzhen Xu1, Xiaofeng Chen3

    CMC-Computers, Materials & Continua, Vol.65, No.2, pp. 1397-1409, 2020, DOI:10.32604/cmc.2020.011399

    Abstract As an important branch of machine learning, clustering analysis is widely used in some fields, e.g., image pattern recognition, social network analysis, information security, and so on. In this paper, we consider the designing of clustering algorithm in quantum scenario, and propose a quantum hierarchical agglomerative clustering algorithm, which is based on one dimension discrete quantum walk with single-point phase defects. In the proposed algorithm, two nonclassical characters of this kind of quantum walk, localization and ballistic effects, are exploited. At first, each data point is viewed as a particle and performed this kind of quantum walk with a parameter,… More >

  • Open Access

    ARTICLE

    A Direct Data-Cluster Analysis Method Based on Neutrosophic Set Implication

    Sudan Jha1, Gyanendra Prasad Joshi2, Lewis Nkenyereya3, Dae Wan Kim4, *, Florentin Smarandache5

    CMC-Computers, Materials & Continua, Vol.65, No.2, pp. 1203-1220, 2020, DOI:10.32604/cmc.2020.011618

    Abstract Raw data are classified using clustering techniques in a reasonable manner to create disjoint clusters. A lot of clustering algorithms based on specific parameters have been proposed to access a high volume of datasets. This paper focuses on cluster analysis based on neutrosophic set implication, i.e., a k-means algorithm with a threshold-based clustering technique. This algorithm addresses the shortcomings of the k-means clustering algorithm by overcoming the limitations of the threshold-based clustering algorithm. To evaluate the validity of the proposed method, several validity measures and validity indices are applied to the Iris dataset (from the University of California, Irvine, Machine… More >

  • Open Access

    ARTICLE

    A Novel Cardholder Behavior Model for Detecting Credit Card Fraud

    Yiğit Kültür, Mehmet Ufuk Çağlayan

    Intelligent Automation & Soft Computing, Vol.24, No.4, pp. 807-817, 2018, DOI:10.1080/10798587.2017.1342415

    Abstract Because credit card fraud costs the banking sector billions of dollars every year, decreasing the losses incurred from credit card fraud is an important driver for the sector and end-users. In this paper, we focus on analyzing cardholder spending behavior and propose a novel cardholder behavior model for detecting credit card fraud. The model is called the Cardholder Behavior Model (CBM). Two focus points are proposed and evaluated for CBMs. The first focus point is building the behavior model using single-card transactions versus multi-card transactions. As the second focus point, we introduce holiday seasons as spending periods that are different… More >

  • Open Access

    ARTICLE

    An Intelligent Incremental Filtering Feature Selection and Clustering Algorithm for Effective Classification

    U. Kanimozhi, D. Manjula

    Intelligent Automation & Soft Computing, Vol.24, No.4, pp. 701-709, 2018, DOI:10.1080/10798587.2017.1307626

    Abstract We are witnessing the era of big data computing where computing the resources is becoming the main bottleneck to deal with those large datasets. In the case of high-dimensional data where each view of data is of high dimensionality, feature selection is necessary for further improving the clustering and classification results. In this paper, we propose a new feature selection method, Incremental Filtering Feature Selection (IF2S) algorithm, and a new clustering algorithm, Temporal Interval based Fuzzy Minimal Clustering (TIFMC) algorithm that employs the Fuzzy Rough Set for selecting optimal subset of features and for effective grouping of large volumes of… More >

  • Open Access

    ARTICLE

    A Clustering-based Approach for Balancing and Scheduling Bicycle-sharing Systems

    Imed Kacem, Ahmed Kadri, Pierre Laroche

    Intelligent Automation & Soft Computing, Vol.24, No.2, pp. 421-430, 2018, DOI:10.31209/2018.100000016

    Abstract This paper addresses an inventory regulation problem in bicycle sharingsystems. The problem is to balance a network consisting of a set of stations by using a single vehicle, with the aim of minimizing the weighted sum of the waiting times during which some stations remain imbalanced. Motivated by the complexity of this problem, we propose a two-stage procedure based on decomposition. First, the network is divided into multiple zones by using two different clustering strategies. Then, the balancing problem is solved in each zone. Finally, the order in which the zones must be visited is defined. To solve these problems,… More >

  • Open Access

    ARTICLE

    Tumor Classfication UsingG Automatic Multi-thresholding

    Li-Hong Juanga, Ming-Ni Wub

    Intelligent Automation & Soft Computing, Vol.24, No.2, pp. 257-266, 2018, DOI:10.1080/10798587.2016.1272778

    Abstract In this paper we explore these math approaches for medical image applications. The application of the proposed method for detection tumor will be able to distinguish exactly tumor size and region. In this research, some major design and experimental results of tumor objects detection method for medical brain images is developed to utilize an automatic multi-thresholding method to handle this problem by combining the histogram analysis and the Otsu clustering. The histogram evaluations can decide the superior number of clusters firstly. The Otsu classification algorithm solves the given medical image by continuously separating the input gray-level image by multi-thresholding until… More >

  • Open Access

    ARTICLE

    Analysis of Twitter Data Using Evolutionary Clustering during the COVID-19 Pandemic

    Ibrahim Arpaci1, Shadi Alshehabi2, Mostafa Al-Emran3, *, Mahmoud Khasawneh4, Ibrahim Mahariq4, Thabet Abdeljawad5, 6, 7, Aboul Ella Hassanien8, 9

    CMC-Computers, Materials & Continua, Vol.65, No.1, pp. 193-204, 2020, DOI:10.32604/cmc.2020.011489

    Abstract People started posting textual tweets on Twitter as soon as the novel coronavirus (COVID-19) emerged. Analyzing these tweets can assist institutions in better decision-making and prioritizing their tasks. Therefore, this study aimed to analyze 43 million tweets collected between March 22 and March 30, 2020 and describe the trend of public attention given to the topics related to the COVID-19 epidemic using evolutionary clustering analysis. The results indicated that unigram terms were trended more frequently than bigram and trigram terms. A large number of tweets about the COVID-19 were disseminated and received widespread public attention during the epidemic. The high-frequency… More >

Displaying 381-390 on page 39 of 444. Per Page