Web Mining Competitors Analyses for Frequent Unstructured Dataset Using Pattern Mining Utility Incremental Ranking Results Based on Query Process
DOI:
https://doi.org/10.37591/jowet.v5i3.1873Abstract
Abstract
Nowadays, the mining competition in the market requires best approach fir every company to distinguish not only which companies are its primary competitors but also in whichdomains the company’s rivals compete with itself and what its competitors’ strength is in a specific competitive domain. The task ofcompetitor mining that we address in the paper includes mining all the information such as competitors, competing domains, andcompetitors’ strengthproblems which potential privacy invasion and potential discrimination for mining competitors. Computerized data accumulation and data mining systems, for example, grouping guideline mining have passed the best approach to making mechanized different calculations problems like managing an account, showroom, shopping and so on. They leads datasets debases the mining execution as far as execution time and space prerequisite. The circumstance may turn out to be more terrible when the database contains heaps of long exchanges or long high utility item sets. To propose pattern utility incremental algorithm (PUIA) for unstructured data analysis with continuous discovering the complete set of frequent patterns in time series in machine learning approach to the neural network databases estimating the number of refresh item sets, we manufacture a question cost demonstrate for the related datasets which can be utilized to evaluate the quantity of datasets determined incoherency bound with outline to defeat the current terms.
Keywords: competitors mining, high utility analysis, pattern mining, ranking service, machine learning.
Cite this Article
Ramya S, Alaguraj N. Web Mining Competitors Analyses for Frequent Unstructured Dataset Using Pattern Mining Utility Incremental Ranking Results Based on Query Process, 2018. Journal of Web Engineering & Technology. 2018; 5(3): 38–46p.
References
Morinaga S, Yamanishi K, Tateishi K, Fukushinna T. Mining product reputations on the web, Proc. ACMSIGKDD ’02, Edmonton, Alberta, Canada, 2002, 341–349p.
Liu B, Chin C. Mining topic-specific concepts and definitions on the web, Proc. 12th Int’l Conf. World Wide Web (WWW ’03), Budapest, Hungary, 2003, 251–260p.
Zhai C, Velivelli A, Yu B. A cross-collection mixture model for comparative text mining, Proc. ACM SIGKDD ’04, Seattle, WA, USA, 2004, 743–748p.
Liu B, Hu M, Cheng J. Opinion observer: analyzing and comparing opinions on the web, Proc. 14th Int’l Conf. WorldWide Web (WWW ’05), Chiba, Japan, 2005, 342–351p.
Jindal N, Liu B. Mining comparative sentences and relations, Proc. 21st Nat’l Conf. Artificial Intelligence (AAAI), 2006.
Chuang K-T, Huang J-L, Chen M-S. Power-law relationship and Self-similarity in the item set support distribution: Analysis and applications, VLDB J. Aug. 2008; 17: 1121–1141p.
Tanbeer SK, Ahmed CF, Jeong B-S, Lee Y-K. Discovering periodic-frequent patterns in transactional databases, in PAKDD 2009, ser. LNCS, Springer, 2009; 5476: 242–253p.
Bao S, Cao Y, Liu B, Yu Y, Li H. Mining latent associations of objects using a typed mixture model—a case study on expert/expertise mining, Proc. Sixth IEEE Int’l Conf. Data Mining (ICDM ’06), Hong Kong, China, 2006, 803–807p.
Li Y, Yeh J, Chang C. Isolated items discarding strategy for discovering high-utility item sets, Data Knowl Eng. 2008; 64(1): 198–217p.
Le T, Vo B. An efficient algorithm for mining erasable item sets, Eng Appl Artif Intell. 2014; 27: 155–166p.
Shuning Xing, Fangai Liu, Jiwei Wang, Lin Pang, Zhenguo Xu, Utility pattern mining algorithm bases on improved utility pattern tree, 8th International Symposium on Computational Intelligence and Design, Hangzhou, China, 2015, 258–261p.
Vincent S. Tseng, Cheng-wei Wu, Philippe Fournier-Viger, Philip S. Yu, Efficient algorithms for mining Top-K high utility item sets, IEEE T Knowl Data Eng. January 2016; 28(1): 54–67p.
Boxiang Dong, Ruilin Liu, Hui (Wendy) Wang, Trust-but-Verify: verifying result correctness of outsourced frequent item set mining in data-mining-as-a-service paradigm, IEEE T Serv Comput, Feb. 2016; 9(1): 18–32p.
Hong TP, Lin CW, Lin KY, Vo B. An incremental mining algorithm for erasable item sets, IEEE International Conference on Innovationsin Intelligent Systems and Applications, 2017, Gdynia, Poland.
Downloads
Published
Issue
Section
License
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
- I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
- I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
- I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
- I/We also agree to the authorship of the article in the following order:
Author’s name
1. ________________
2. ________________
3. ________________
4. ________________
We Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal. |
