5
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      E-Commerce Information System Management Based on Data Mining and Neural Network Algorithms

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The rapid development of artificial intelligence technology has led to rapid development in various fields. It has many hidden related customer behavior information and future development trends in the e-commerce information system. The data mining technology can dig out useful information and promote the development of e-commerce. This research analyzes the significance and advantages of data mining technology in the application of e-commerce management systems and analyzes the related technologies of data mining and future trend prediction. This research has taken the advantages of clustering and naive Bayesian methods in data mining to classify product information and purchase preferences and other information and mine the associated data. Then, the nonlinear data processing advantages of neural networks are used to predict future purchasing power. The results show that data mining technology and neural networks have high accuracy in predicting future consumer purchasing power information. The correlation coefficient between real consumption data and predicted consumption data reached 0.9785, and the maximum relative average error was only 2.32%. It fully shows that data mining technology can obtain some unrecognizable related information and future consumption trends in e-commerce systems, and neural networks can also predict future consumption power and consumption patterns well.

          Related collections

          Most cited references43

          • Record: found
          • Abstract: not found
          • Article: not found

          Big data analytics in E-commerce: a systematic review and agenda for future research

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Mining customer requirements from online reviews: A product improvement perspective

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found
              Is Open Access

              A Novel K-Means Clustering Algorithm with a Noise Algorithm for Capturing Urban Hotspots

              With the development of cities, urban congestion is nearly an unavoidable problem for almost every large-scale city. Road planning is an effective means to alleviate urban congestion, which is a classical non-deterministic polynomial time (NP) hard problem, and has become an important research hotspot in recent years. A K-means clustering algorithm is an iterative clustering analysis algorithm that has been regarded as an effective means to solve urban road planning problems by scholars for the past several decades; however, it is very difficult to determine the number of clusters and sensitively initialize the center cluster. In order to solve these problems, a novel K-means clustering algorithm based on a noise algorithm is developed to capture urban hotspots in this paper. The noise algorithm is employed to randomly enhance the attribution of data points and output results of clustering by adding noise judgment in order to automatically obtain the number of clusters for the given data and initialize the center cluster. Four unsupervised evaluation indexes, namely, DB, PBM, SC, and SSE, are directly used to evaluate and analyze the clustering results, and a nonparametric Wilcoxon statistical analysis method is employed to verify the distribution states and differences between clustering results. Finally, five taxi GPS datasets from Aracaju (Brazil), San Francisco (USA), Rome (Italy), Chongqing (China), and Beijing (China) are selected to test and verify the effectiveness of the proposed noise K-means clustering algorithm by comparing the algorithm with fuzzy C-means, K-means, and K-means plus approaches. The compared experiment results show that the noise algorithm can reasonably obtain the number of clusters and initialize the center cluster, and the proposed noise K-means clustering algorithm demonstrates better clustering performance and accurately obtains clustering results, as well as effectively capturing urban hotspots.
                Bookmark

                Author and article information

                Contributors
                Journal
                Comput Intell Neurosci
                Comput Intell Neurosci
                cin
                Computational Intelligence and Neuroscience
                Hindawi
                1687-5265
                1687-5273
                2022
                11 April 2022
                : 2022
                : 1499801
                Affiliations
                1School of Business and Economics, University Putra Malaysia, 43400 Seri Kembangan, Malaysia
                2Laboratory of Computational Statistics and Operations Research, Institute for Mathematical Research, Universiti Putra Malaysia, 43400 UPM Serdang, Selangor, Malaysia
                Author notes

                Academic Editor: Shahid Mumtaz

                Author information
                https://orcid.org/0000-0002-6982-4441
                https://orcid.org/0000-0002-5797-7707
                Article
                10.1155/2022/1499801
                9017534
                017580da-dc16-4cbc-95c7-29294bb32a3b
                Copyright © 2022 Qing Zhang et al.

                This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

                History
                : 10 January 2022
                : 16 February 2022
                : 24 February 2022
                Categories
                Research Article

                Neurosciences
                Neurosciences

                Comments

                Comment on this article