fbpx

Comparative Analysis of PCA and Recursive Feature Elimination Technique for Feature Extraction in Community Mining using E-Commerce


Call for Papers Engineering Journal, May 2019

Download Full-Text PDF Cite this Publication

Text Only Version

Comparative Analysis of PCA and Recursive Feature Elimination Technique for Feature Extraction in Community Mining using E-Commerce

Spoorthi C B.E., (M.Tech)1

Dept. of Computer Science & Engineering Adichunchanagiri Institute of Technology Chikkamagaluru, Karnataka, India

Dr. Pushpa Ravikumar B.E., M.Tech., Ph.D2 Dept. of Computer Science & Engineering Adichunchanagiri Institute of Technology Chikkamagaluru, Karnataka, India

AbstractAdvancement of innovation has brought about a critical development in every single field beginning from business to analyze. At present the examination is being completed in each division to decide the regular clients, break down their conduct in wording their buy and different components. Key player is the person who is found to make the regular buy which serves to expand the income of retailers. In this proposed work a proficient model is created by applying the Data mining techniques like preprocessing, Feature extraction, Network build for shopping dataset and Community mining. Preprocessing is completed utilizing the calculation regex and mean vector. The preprocessed information must be decreased as far as its measurement for which the element choice is connected. The calculations PCA with precision 90%, recursive component disposal with precision 72% and Karl Pearson Correlation is likewise utilized to compare the accuracy came for preprocessed data is 90.89% and accuracy came for feature extraction is 92.25%.

Keywords Data Mining, Customer behaviour, E-commerce, Feature extraction, Community Mining

  1. INTRODUCTION

    Social network is concerned much about substantial quantities of clients acting together with some relationship. Community mining is one of the vital headings in informal organization investigation. The informal communities are various, heterogeneous and dynamic in nature. Which speaks to a specific relationship dependent on some regularly shared properties, and every sort of relationship may participate in an alternate job in a specific task.

    Data mining techniques is used for shopping dataset to identify the loyal customer and to give a more benefit, promotion and to manage a community network in a superior way.

    The enormous data from various fields like guidance field well being area, web business and significantly more systems. So separating the huge volume of data and building system to perceive the eagerness among the different identities of the overall public in tremendous data is fundamental in these days. Mining gatherings or network in a framework is basic for examining and fundamental administration in different structures is basic [1].

    Nowadays the central issue in network mining is streamlining. None of the strategies decisively recognize the

    basic hub in the framework is major. The most necessities for such an enormous data is its examination. The condition is made such a way, that the data is more with us anyway information is less concerning data. So the information extraction is a trying errand for getting increasingly proficient information.

    Not by try, mining or perceiving groups in immense frameworks have saved applications, since hubs in a practically identical assembling everything considered have essential properties or relationship as to center points interconnecting arranged social occasions [2]. For instance, individuals in a get-together of customers may have basic interests a get-together of stubbornly related proteins as frequently as conceivable team up for an offered sensible insistence, and tweets under a near point constantly spread the for all intents and purposes indistinguishable estimation.

    At the point when the relationship among the clients is perceived in an online business [2], it is definitely not hard to foresee the energy among the customers. The main aim of this project is to identify the key player in a community. The community is build for a preprocessed data. By using an algorthim called dependency the community is build and mining techniques are used to predict the key player in a network.

  2. LITERATURE SURVEY

    1. Behaviour analysis of customer

      Varun E [1] has proposed information mining framework is important to consider purchasing conduct of the clients in Ecommerce stores. By thought of the profitable client the examination began on complete anticipating the acquiring conduct properties of client. The information mining structure is exceptionally useful for association to begin the relationship of client with different things

    2. Frame of Mining community

      The Pushpa Ravikumar [2] has proposed network exchange is basic for mining adventure supportability and accomplishment. The composition exhibits a sensible association between system sponsorship and supportability. Quantifiable measurements factors have been seemed to impact organize affirmation.

  3. METHODOLOGY

    Data mining method is choosed for community build and for mining for the purpose of finding the loyal customer in a shopping dataset which is explained using flow chart in the figure 1.

      1. Data Collection

        The process of collecting a dataset from a shopping website. The data is cleaned because the so much of noise is present. By using the two algorthim it is cleaned and compared their accuracy to know which the best algorthim for cleaning process.

      2. Data Preprocessing

        In a community build the very important step is data preprocessing. In this dataset the noisy like regular expression, delimiter, comma, and unknown string are present in the datset. To remove this the algorthim called regex is used for cleaning and for missing value the mean weighted average vector is used to fill the values.

      3. Feature Extraction

        After preprocessing the feature extraction technique is used from a data mining techniques. The preprocessed data has to reduce dimension from a feature selection method. The two algorthim is used for comparison.

      4. Building a Community

        In this area system can be viewed as the most fundamental unsupervised learning issue alongside as each other issue of this sort it makes sense of how to find a structure in a gathering of unlabelled information showed up.

      5. Community Mining

    Once the community is built the next step is to find the loyal customer from a network. From each network the centrality measures is calculated to find the key player in a whole community network.

    Algorthim: Recursive Feature Elimination

    1. Train the model on the training set

    2. Calculate model performance

    3. Calculate variable importance that is ranking

    4. for Each subset size Sip, i = 1..S do

    5. Keep the Si most important variable

    6. [optional] pre-process the data

    7. train the model on the training set using predictors

    8. Calculate model performance

    9. Recalculate the ranking for each predictor

    10. end

    11. Calculate the performance profile over the Si

    12. Determine the appropriate number of predictors

    13. Use the model corresponding to the original Si

    Algorthim: Recursive Feature Elimination

    1. Train the model on the training set

    2. Calculate model performance

    3. Calculate variable importance that is ranking

    4. for Each subset size Sip, i = 1..S do

    5. Keep the Si most important variable

    6. [optional] pre-process the data

    7. train the model on the trining set using predictors

    8. Calculate model performance

    9. Recalculate the ranking for each predictor

    10. end

    11. Calculate the performance profile over the Si

    12. Determine the appropriate number of predictors

    13. Use the model corresponding to the original Si

    Figure 1: Community Mining for Analyzing Customer Behaviour

    Table 1 depicts the contiguousness lattice of a five client which is higly associated with one another.

    Table 1: Adjacency Matrix of five customer

    6

    29

    33

    34

    35

    6

    1.0000

    -0.0030

    0.0032

    0.0028

    0.0313

    29

    0.0145

    1.0000

    -0.6650

    -0.5782

    0.6024

  4. RESULT AND DISCUSSION

    The snapshot gives a thought of a proposed work. These are the depictions taken when the framework is effectively executing the code.

    Figure 2: Raw data for preprocessing

    Figure 2 describes the before preprocessed shopping raw dataset which is taken from a known shopping websites. The data consists of noise and it is present in the format excel.

    Figure 3: Feature extraction analysis graph

    Figure 3 describes the preprocessed data graph which is filled with missing values. By applying the algorthim of feature extraction it gives the important attributes for community build.

    Figure 4: Histogram with the selected feature for community build

    Figure 4 gives the result of a selected attributes with a rank using a histogram. The correlation matrix is obtained from a feature extraction.

    Figure 5: Community building for each network

    Figure 5 present the size of a node and edges with colors. It is specifying the each community in a small network. The algorthim modularity is used for building a network.

    Figure 6 provides the closeness centrality with a value of a degree, closeness, and betweeness to calculate and to average these three values to find the community.

    Figure 6: Centrality measure for community

    Figure 7 describing the key customer from a calculation of a centrality measure using a community mining techniques. The community is mined with a key player who get more benefits from a owner of a shop.

    Figure 7: Calculating betweeness, closeness, degreeness for loyal customer identification

    Figure 8: Pre-processed data for accuracy measure

    Figure 8 provides the measure for pre-processed data to find for accuracy in a cleaning process. The confusion matrix is also built under ROC curve. The accuracy came for preprocessed data is 91.89%. The X-axis specifies the false positive rate and Y-axis specifies the true positive rate.

    Figure 9 provides a brief description about the feature selection process. The accuracy for predicting the loyal customer in a E-commerce using a confusion matrix. The ROC curve gives the description about the X-axis gives the false positive and Y-axis specifies the true positive with accuracy 92.25%.

    Figure 9: Feature extraction analysis graph

  5. CONCLUSION

    The client conduct can be broke down utilizing the network assembled utilizing the prepared dataset. The preprocessing strategy regex and mean weighted normal vector expels accentuation marks, supplant invalid an incentive with proper esteem individually. Highlight determination calculation PCA is found to give better precision of 90% when contrasted with recursive element end procedure which gives the exactness 69%. Precision and disarray grid of a pre-handled information is 91.89%. The exactness for highlight separated information is 92.25%. The centrality measure is utilized to recognize the key client in a shopping dataset which expands the income of retailers or organizations. The people group is assembled utilizing the dataset and every one of the key players in the network distinguished. The centrality measure can be additionally utilized in various areas to recognize the key player. In this

    proposed work the key player ID utilizing data mining is observed to be progressively proficient.

  6. ACKNOWLEDGMENT

REFERENCES

  1. Varun E and Dr. Pushpa Ravikumar, Attribute Selection for Telecommunication Churn Prediction, International Journal of Engineering & Technology, Vol. 7, No 4.39, 2018, pp.506-509.

  2. Varun E and Dr. Pushpa Ravikumar, Community Mining In Multi- Relational and Heterogeneous Telecom Network, IEEE 6th International Conference on Advanced Computing (IACC-2016), DOI:10.1109/IACC.2016.15.

  3. Chun Fu Lin, Yu Hsin Hung, and Ray I Chang, Mining Customer Behavior Knowledge to Develop Analytical Expert System for Beverage Marketing, International Journal of Computer Trends and Technology (IJCTT) – volume4Issue4 April 2013.

  4. Afolabi Ibukun.T, Olufunke Oladipupo, Rowland E. Worlu & Akinyemi I. O, A Systematic Review of Consumer Behaviour Prediction Studies, Covenant Journal of Business & Social Sciences (CJBSS), Vol. 7, No.1, June 2016.

Leave a Reply

Your email address will not be published. Required fields are marked *