• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.2
• /
• pp.104-109
• /
• 2006

We can offer suitable information to users analyzing the pattern of users. An association rule is one of data mining techniques which can discover the pattern. We use an association rule which considers the web page visiting time and we should the pattern analyse of users. The offered method puts the weights in Web page visiting time of the user and produces an association rule. Weight is web page visiting time unit divide to total of web page visiting time. We offer rather meaningful result the association rule by Apriori algorithm. This method that proposes in the paper offers rather meaningful result Apriori algorithm

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.99-102
• /
• 2007

웹 사용 마이닝은 사용자의 웹 이용 패턴에 대해 분석하여 정보를 찾아내는 분야이다. 사용자에 대한 분석은 웹을 통한 비즈니스의 근간이 되고 있다. 때문에 웹 마이닝 분야에서 주목받고 중요시 되는 기술이 되었다. 그러나 최근에는 공개된 기술의 취약점을 이용해 악의적으로 정보를 교란하는 일이 발생되고 있어 사회적으로 이슈가 되고 있다. 이러한 문제는 특히 단순한 페이지 뷰 횟수에 기반을 둔 정보 추출 방식에 주로 발생하고 있다. 따라서 본 논문에서는 이러한 추출 방식의 단순함을 줄이고 사용자의 정보를 더 반영하기 위하여 페이지 이용 시간과 페이지 내의 행동을 분석하여 콘텐츠의 질을 평가하는 방안을 제시한다. 구현 부분에는 사용자의 개인정보 침해 없이 사용자의 행동을 수집하기 위하여 최근 인기를 얻고 있는 Ajax 기술을 사용하였다. 그리고 실시간으로 웹 페이지에 대한 평가를 수행하기 위해 서버에 로그 필터 모듈을 추가하는 수집 기법을 제안하였다.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.528-533
• /
• 2008

Web page evaluation is important issue in the Internet. Web pages are increasing extremely fast. The web page evaluation based on frequency, like the count of the page view (PV), is not sufficient way even it is used variously. Because users never use the unnecessary or irrelevant web pages for a long time. We concentrated on user's visiting duration time for the evaluation web pages. And we can collect user actions. Users do some action when users using the web page in the web browser. The movements of mouse pointer, mouse button click, page scrolling and so on are produced in the web browser. JavaScript can collect user action and Ajax can send collected data to server when user using the web browser without no user notification.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.37-46
• /
• 2005

In the Web environment with a huge amount of information, Web page access patterns for the users visiting certain web site can be diverse and change continually in accordance with the change of its environment. Therefore it is almost impossible to develop and design web sites which fit perfectly for every web user's desire. Adaptive web site was proposed as solution to this problem. In this paper, we will present an effective method that uses a probabilistic model of DTMC(Discrete-Time Markov Chain) for learning user's access patterns and applying these patterns to construct an adaptive web site.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.263-269
• /
• 2005

Users who use Web site wish to get information conveniently. To users who web site operators use Web site differentiation to provide done service pattern analysis by user do must. Association rule is one of data Mining techniques for pattern discovery. If search for pattern by user, differentiation by user done service offer can. Association rule search result that pattern by user can know, and considers web page visiting time for association rule search differentiation done web structure service and recommendation service possible.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.55-57
• /
• 2001

웹로그 마이닝은 대용량의 웹로그 데이터로부터 웹액세스 패턴을 추출함으로써 사용자의 행등 패턴을 찾아내는데 이러한 작업은 웹사이트 설계상의 문제점 등을 발견 및 보완하거나 사용자에게 개인화 페이지를 제공하는데 이용될 수 있다. 사용자의 관심도를 반영하는 웹액세스 패턴을 추출할 때 페이지의 액세스 횟수 뿐만 아니라 페이지의 소요 시간까지 고려함으로써 더욱 정확한 액세스 패턴을 추출하는 것이 본 논문의 목적이다.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.19-27
• /
• 2007

We have implemented a WWW homepage which finds an optimal route for users. There already exist many web sites which provide the optimal route when a start and a destination cities are given. However, none of them can find the optimal route when a number of cities to be visited. The problem of finding the optimal route starting at a given start city and visiting through all the given intermediate cities and finally returning to the start city is called Travelling Sales Person(TSP) problem. TSP is a well known exponential time complexity problem. We have implemented an artificial intelligent search algorithm for TSP on our homepage. The main feature of our algorithm is that the destination may not be the same as the start city whereas all of the existing heuristic algorithms for TSP assume that the start and the destination cities are the same. The web page asks a user to select all the cities he or she wants to visit(including start and destination city), then it finds a sequence of the cities such that the user would travel minimum distance if he or she visits the cities in the order of the sequence. This paper presents algorithms used in the homepage.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2292-2298
• /
• 2010

A mashup is a web page or application that uses and combines information, contents or Open APIs available on the web to create a new service. The mashup developed by the need not combination of simple information can contribute to new added-values with practicality and convenience. Thus, in this paper, we want to develop a RIA-based dynamic mashup service for the users considering weather forecast and marine information importantly. We design and implement the system that it can register a number of information about a domain dynamically through registration process based on the map and present a mark of domain location on the map and the information including internal environment, external environment and weather of related to the domain within a webpage. Implemented service need not require a tedious process visiting other web sites every time to confirm the relevant information because we can see simultaneously related information with a map within a page.

• Journal of Internet Computing and Services
• /
• v.20 no.3
• /
• pp.43-59
• /
• 2019

Today, with the spread of smartphones and the development of social networking services, structured and unstructured big data have stored exponentially. If we analyze them well, we will get useful information to be able to predict data for the future. Large amounts of data need to be collected first in order to analyze big data. The web is repository where these data are most stored. However, because the data size is large, there are also many data that have information that is not needed as much as there are data that have useful information. This has made it important to collect data efficiently, where data with unnecessary information is filtered and only collected data with useful information. Web crawlers cannot download all pages due to some constraints such as network bandwidth, operational time, and data storage. This is why we should avoid visiting many pages that are not relevant to what we want and download only important pages as soon as possible. This paper seeks to help resolve the above issues. First, We introduce basic web-crawling algorithms. For each algorithm, the time-complexity and pros and cons are described, and compared and analyzed. Next, we introduce the state-of-the-art web crawling algorithms that have improved the shortcomings of the basic web crawling algorithms. In addition, recent research trends show that the web crawling algorithms with special purposes such as collecting sentiment words are actively studied. We will one of the introduce Sentiment-aware web crawling techniques that is a proactive web crawling technique as a study of web crawling algorithms with special purpose. The result showed that the larger the data are, the higher the performance is and the more space is saved.

• Journal of Intelligence and Information Systems
• /
• v.25 no.1
• /
• pp.85-107
• /
• 2019

Online consumers browse products belonging to a particular product line or brand for purchase, or simply leave a wide range of navigation without making purchase. The research on the behavior and purchase of online consumers has been steadily progressed, and related services and applications based on behavior data of consumers have been developed in practice. In recent years, customization strategies and recommendation systems of consumers have been utilized due to the development of big data technology, and attempts are being made to optimize users' shopping experience. However, even in such an attempt, it is very unlikely that online consumers will actually be able to visit the website and switch to the purchase stage. This is because online consumers do not just visit the website to purchase products but use and browse the websites differently according to their shopping motives and purposes. Therefore, it is important to analyze various types of visits as well as visits to purchase, which is important for understanding the behaviors of online consumers. In this study, we explored the clustering analysis of session based on click stream data of e-commerce company in order to explain diversity and complexity of search behavior of online consumers and typified search behavior. For the analysis, we converted data points of more than 8 million pages units into visit units' sessions, resulting in a total of over 500,000 website visit sessions. For each visit session, 12 characteristics such as page view, duration, search diversity, and page type concentration were extracted for clustering analysis. Considering the size of the data set, we performed the analysis using the Mini-Batch K-means algorithm, which has advantages in terms of learning speed and efficiency while maintaining the clustering performance similar to that of the clustering algorithm K-means. The most optimized number of clusters was derived from four, and the differences in session unit characteristics and purchasing rates were identified for each cluster. The online consumer visits the website several times and learns about the product and decides the purchase. In order to analyze the purchasing process over several visits of the online consumer, we constructed the visiting sequence data of the consumer based on the navigation patterns in the web site derived clustering analysis. The visit sequence data includes a series of visiting sequences until one purchase is made, and the items constituting one sequence become cluster labels derived from the foregoing. We have separately established a sequence data for consumers who have made purchases and data on visits for consumers who have only explored products without making purchases during the same period of time. And then sequential pattern mining was applied to extract frequent patterns from each sequence data. The minimum support is set to 10%, and frequent patterns consist of a sequence of cluster labels. While there are common derived patterns in both sequence data, there are also frequent patterns derived only from one side of sequence data. We found that the consumers who made purchases through the comparative analysis of the extracted frequent patterns showed the visiting pattern to decide to purchase the product repeatedly while searching for the specific product. The implication of this study is that we analyze the search type of online consumers by using large - scale click stream data and analyze the patterns of them to explain the behavior of purchasing process with data-driven point. Most studies that typology of online consumers have focused on the characteristics of the type and what factors are key in distinguishing that type. In this study, we carried out an analysis to type the behavior of online consumers, and further analyzed what order the types could be organized into one another and become a series of search patterns. In addition, online retailers will be able to try to improve their purchasing conversion through marketing strategies and recommendations for various types of visit and will be able to evaluate the effect of the strategy through changes in consumers' visit patterns.