• Title/Summary/Keyword: Web mining

Search Result 550, Processing Time 0.025 seconds

Hybrid Internet Business Model using Evolutionary Support Vector Regression and Web Response Survey

  • Jun, Sung-Hae
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2006.11a
    • /
    • pp.408-411
    • /
    • 2006
  • Currently, the nano economy threatens the mass economy. This is based on the internet business models. In the nano business models based on internet, the diversely personalized services are needed. Many researches of the personalization on the web have been studied. The web usage mining using click stream data is a tool for personalization model. In this paper, we propose an internet business model using evolutionary support vector machine and web response survey as a web usage mining. After analyzing click stream data for web usage mining, a personalized service model is constructed in our work. Also, using an approach of web response survey, we improve the performance of the customers' satisfaction. From the experimental results, we verify the performance of proposed model using two data sets from KDD Cup 2000 and our web server.

  • PDF

User Identification and Session completion in Input Data Preprocessing for Web Mining (웹 마이닝을 위한 입력 데이타의 전처리과정에서 사용자구분과 세션보정)

  • 최영환;이상용
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.9
    • /
    • pp.843-849
    • /
    • 2003
  • Web usage mining is the technique of data mining that analyzes web users' usage patterns by large web log. To use the web usage mining technique, we have to classify correctly users and users session in preprocessing, but can't classify them completely by only log files with standard web log format. To classify users and user session there are many problems like local cache, firewall, ISP, user privacy, cookey etc., but there isn't any definite method to solve the problems now. Especially local cache problem is the most difficult problem to classify user session which is used as input in web mining systems. In this paper we propose a heuristic method which solves local cache problem by using only click stream data of server side like referrer log, agent log and access log, classifies user sessions and completes session.

A Big Data Study on Viewers' Response and Success Factors in the D2C Era Focused on tvN's Web-real Variety 'SinSeoYuGi' and Naver TV Cast Programming

  • Oh, Sejong;Ahn, Sunghun;Byun, Jungmin
    • International Journal of Advanced Culture Technology
    • /
    • v.4 no.2
    • /
    • pp.7-18
    • /
    • 2016
  • The first D2C-era web-real variety show in Korea was broadcast via tvN of CJ E&M. The web-real variety program 'SinSeoYuGi' accumulated 54 million views, along with 50 million views at the Chinese portal site QQ. This study carries out an analysis using text mining that extracts portal site blogs, twitter page views and associative terms. In addition, this study derives viewers' response by extracting key words with opinion mining techniques that divide positive words, neutral words and negative words through customer sentiment analysis. It is found that the success factors of the web-real variety were reduced in appearance fees and production cost, harmony between actual cast members and scenario characters, mobile TV programing, and pre-roll advertising. It is expected that web-real variety broadcasting will increase in value as web contents in the future, and be established as a new genre with the job of 'technical marketer' growing as well.

WebPR : A Dynamic Web Page Recommendation Algorithm Based on Mining Frequent Traversal Patterns (WebPR :빈발 순회패턴 탐사에 기반한 동적 웹페이지 추천 알고리즘)

  • Yoon, Sun-Hee;Kim, Sam-Keun;Lee, Chang-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.11B no.2
    • /
    • pp.187-198
    • /
    • 2004
  • The World-Wide Web is the largest distributed Information space and has grown to encompass diverse information resources. However, although Web is growing exponentially, the individual's capacity to read and digest contents is essentially fixed. From the view point of Web users, they can be confused by explosion of Web information, by constantly changing Web environments, and by lack of understanding needs of Web users. In these Web environments, mining traversal patterns is an important problem in Web mining with a host of application domains including system design and Information services. Conventional traversal pattern mining systems use the inter-pages association in sessions with only a very restricted mechanism (based on vector or matrix) for generating frequent k-Pagesets. We develop a family of novel algorithms (termed WebPR - Web Page Recommend) for mining frequent traversal patterns and then pageset to recommend. Our algorithms provide Web users with new page views, which Include pagesets to recommend, so that users can effectively traverse its Web site. The main distinguishing factors are both a point consistently spanning schemes applying inter-pages association for mining frequent traversal patterns and a point proposing the most efficient tree model. Our experimentation with two real data sets, including Lady Asiana and KBS media server site, clearly validates that our method outperforms conventional methods.

A Clustering Algorithm for Sequence Data Using Rough Set Theory (러프 셋 이론을 이용한 시퀀스 데이터의 클러스터링 알고리즘)

  • Oh, Seung-Joon;Park, Chan-Woong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.2
    • /
    • pp.113-119
    • /
    • 2008
  • The World Wide Web is a dynamic collection of pages that includes a huge number of hyperlinks and huge volumes of usage informations. The resulting growth in online information combined with the almost unstructured web data necessitates the development of powerful web data mining tools. Recently, a number of approaches have been developed for dealing with specific aspects of web usage mining for the purpose of automatically discovering user profiles. We analyze sequence data, such as web-logs, protein sequences, and retail transactions. In our approach, we propose the clustering algorithm for sequence data using rough set theory. We present a simple example and experimental results using a splice dataset and synthetic datasets.

  • PDF

The Development of the Data Mining Agent for eCRM (eCRM을 위한 데이터마이닝 에지전트의 개발)

  • Son, Dal-Ho;Hong, Duck-Hoon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.5
    • /
    • pp.236-244
    • /
    • 2006
  • Many attempts have been made to track the web usage patterns and provide suggestions that might help web operators get the information they need. These tracking mechanisms rely on mining web log files for usage patterns. The purpose of this study is to verify a web agent prototype that was built for mining web log files. The web agent for this paper was made by Java and ASP and the agent came into being as part of a cookie for a short-term data storage. For long-term data storage, the agent used a My-SQL as a Data Base. This agent system could inform that if the data comes from the web data mining agent, it could be a rapid information providing method rather than the case of data coming into a data mining tool. Therefore, the developed tool in this study will be helpful as a new kind of decision making system and expert system.

  • PDF

A Web-based System for Business Process Discovery: Leveraging the SICN-Oriented Process Mining Algorithm with Django, Cytoscape, and Graphviz

  • Thanh-Hai Nguyen;Kyoung-Sook Kim;Dinh-Lam Pham;Kwanghoon Pio Kim
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.8
    • /
    • pp.2316-2332
    • /
    • 2024
  • In this paper, we introduce a web-based system that leverages the capabilities of the ρ(rho)-algorithm, which is a Structure Information Control Net (SICN)-oriented process mining algorithm, with open-source platforms, including Django, Graphviz, and Cytoscape, to facilitate the rediscovery and visualization of business process models. Our approach involves discovering SICN-oriented process models from process instances from the IEEE XESformatted process enactment event logs dataset. This discovering process is facilitated by the ρ-algorithm, and visualization output is transformed into either a JSON or DOT formatted file, catering to the compatibility requirements of Cytoscape or Graphviz, respectively. The proposed system utilizes the robust Django platform, which enables the creation of a userfriendly web interface. This interface offers a clear, concise, modern, and interactive visualization of the rediscovered business processes, fostering an intuitive exploration experience. The experiment conducted on our proposed web-based process discovery system demonstrates its ability and efficiency showing that the system is a valuable tool for discovering business process models from process event logs. Its development not only contributes to the advancement of process mining but also serves as an educational resource. Readers, students, and practitioners interested in process mining can leverage this system as a completely free process miner to gain hands-on experience in rediscovering and visualizing process models from event logs.

Analysis of Customer Purchase Patterns for Electronic Commerce Using FSM (전자상거래에서 FSM을 이용한 고객구매패턴 분석)

  • 주종문;황승국
    • The Journal of Society for e-Business Studies
    • /
    • v.8 no.3
    • /
    • pp.53-67
    • /
    • 2003
  • The importance of web Mining is highlighted with growth of Electronic Commerce. Web Mining is the important field of subject for studying customer's purchasing trend in Electronic Commerce. This research defined customer's purchasing process as Fuzzy environment in Electronic Commerce. And it suggests new methodology that introduces Fuzzy theory based on current Web Mining methodology

  • PDF

An Efficient Candidate Pattern Storage Tree Structure and Algorithm for Incremental Web Mining (점진적인 웹 마이닝을 위한 효율적인 후보패턴 저장 트리구조 및 알고리즘)

  • Kang, Hee-Seong;Park, Byung-Jun
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.3-5
    • /
    • 2006
  • Recent advances in the internet infrastructure have resulted in a large number of huge Web sites and portals worldwide. These Web sites are being visited by various types of users in many different ways. Among all the web page access sequences from different users, some of them occur so frequently that may need an attention from those who are interested. We call them frequent access patterns and access sequences that can be frequent the candidate patterns. Since these candidate patterns play an important role in the incremental Web mining, it is important to efficiently generate, add, delete, and search for them. This thesis presents a novel tree structure that can efficiently store the candidate patterns and a related set of algorithms for generating the tree structure adding new patterns, deleting unnecessary patterns, and searching for the needed ones. The proposed tree structure has a kind of the 3 dimensional link structure and its nodes are layered.

  • PDF

Identification of Customer Segmentation Sttrategies by Using Machine Learning-Oriented Web-mining Technique (기계학습 기반의 웹 마이닝을 이용한 고객 세분화에 관한 연구)

  • Lee, Kun-Chang;Chung, Nam-Ho
    • IE interfaces
    • /
    • v.16 no.1
    • /
    • pp.54-62
    • /
    • 2003
  • With the ubiquitous use of the Internet in daily business activities, most of modern firms are keenly interested in customer's behaviors on the Internet. That is because a wide variety of information about customer's intention about the target web site can be revealed from IP address, reference address, cookie files, duration time, all of which are expressing customer's behaviors on the Internet. In this sense, this paper aims to accomplish an objective of analyzing a set of exemplar web log files extracted from a specific P2P site, anti identifying information about customer segmentation strategies. Major web mining technique we adopted includes a machine learning like C5.0.