Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Weighted PageRank Algorithm Search Engine Ranking Model for Web Pages

    S. Samsudeen Shaffi1,*, I. Muthulakshmi2

    Intelligent Automation & Soft Computing, Vol.36, No.1, pp. 183-192, 2023, DOI:10.32604/iasc.2023.031494 - 29 September 2022

    Abstract As data grows in size, search engines face new challenges in extracting more relevant content for users’ searches. As a result, a number of retrieval and ranking algorithms have been employed to ensure that the results are relevant to the user’s requirements. Unfortunately, most existing indexes and ranking algorithms crawl documents and web pages based on a limited set of criteria designed to meet user expectations, making it impossible to deliver exceptionally accurate results. As a result, this study investigates and analyses how search engines work, as well as the elements that contribute to higher… More >

  • Open Access

    ARTICLE

    Automatic Clustering of User Behaviour Profiles for Web Recommendation System

    S. Sadesh1,*, Osamah Ibrahim Khalaf2, Mohammad Shorfuzzaman3, Abdulmajeed Alsufyani3, K. Sangeetha4, Mueen Uddin5

    Intelligent Automation & Soft Computing, Vol.35, No.3, pp. 3365-3384, 2023, DOI:10.32604/iasc.2023.030751 - 17 August 2022

    Abstract Web usage mining, content mining, and structure mining comprise the web mining process. Web-Page Recommendation (WPR) development by incorporating Data Mining Techniques (DMT) did not include end-users with improved performance in the obtained filtering results. The cluster user profile-based clustering process is delayed when it has a low precision rate. Markov Chain Monte Carlo-Dynamic Clustering (MC2-DC) is based on the User Behavior Profile (UBP) model group’s similar user behavior on a dynamic update of UBP. The Reversible-Jump Concept (RJC) reviews the history with updated UBP and moves to appropriate clusters. Hamilton’s Filtering Framework (HFF) is designed… More >

  • Open Access

    ARTICLE

    Deep Root Memory Optimized Indexing Methodology for Image Search Engines

    R. Karthikeyan1,*, A. Celine Kavida2, P. Suresh3

    Computer Systems Science and Engineering, Vol.40, No.2, pp. 661-672, 2022, DOI:10.32604/csse.2022.018744 - 09 September 2021

    Abstract Digitization has created an abundance of new information sources by altering how pictures are captured. Accessing large image databases from a web portal requires an opted indexing structure instead of reducing the contents of different kinds of databases for quick processing. This approach paves a path toward the increase of efficient image retrieval techniques and numerous research in image indexing involving large image datasets. Image retrieval usually encounters difficulties like a) merging the diverse representations of images and their Indexing, b) the low-level visual characters and semantic characters associated with an image are indirectly proportional,… More >

  • Open Access

    ARTICLE

    PMS-Sorting: A New Sorting Algorithm Based on Similarity

    Hongbin Wang1, Lianke Zhou1, Guodong Zhao1,*, Nianbin Wang1, Jianguo Sun1, Yue Zheng2, Lei Chen3

    CMC-Computers, Materials & Continua, Vol.59, No.1, pp. 229-237, 2019, DOI:10.32604/cmc.2019.04628

    Abstract Borda sorting algorithm is a kind of improvement algorithm based on weighted position sorting algorithm, it is mainly suitable for the high duplication of search results, for the independent search results, the effect is not very good and the computing method of relative score in Borda sorting algorithm is according to the rule of the linear regressive, but position relationship cannot fully represent the correlation changes. aimed at this drawback, the new sorting algorithm is proposed in this paper, named PMS-Sorting algorithm, firstly the position score of the returned results is standardized processing, and the More >

Displaying 1-10 on page 1 of 4. Per Page