• Korean Management Science Review
• /
• v.23 no.3
• /
• pp.63-75
• /
• 2006

There are many kinds of research on web graph, most of them are focus on the hyperlinked structure of the web graph. Well known results on the web graph are rich-get-richer phenomenon, small-world phenomenon, scale-free network, etc. In this paper, we define 3 new directed web graph, so called the Web Usage Pattern Graph (WUPG), that nodes represent web sites arid arcs between nodes represent a movement between two sites by users' browsing behavior. The data to constructing the WUPG, approximately 56,000 records, are gathered from some users' PCs. The results analysing the data summarized as follows : (i) extremely rich-get-richer phenomenon (ii) average path length between sites is significantly less than the previous one (iii) less external hyperlinks, more internal hyperlinks.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.333-351
• /
• 2002

This paper introduces a search method based on conceptual graph. A hyperlink information is essential to construct conceptual graph in web. The information is very useful as it provides summary and further linkage to construct conceptual graph that has been provided by human. It also has a property which shows review, relation, hierarchy, generality, and visibility. Using this property, we extracted the keywords of web documents and made up of the conceptual graph among the keywords sampled from web pages. This paper extracts the keywords of web pages using anchor text one out of hyperlink information and makes hyperlink of web pages abstract as the link relation between keywords of each web page. 1 suggest this useful search method providing querying word extension or domain knowledge by conceptual graph of keywords. Domain knowledge was conceptualized knowledged as the conceptual graph. Then it is not listing web documents which is the defect of previous search system. And it gives the index of concept associating with querying word.

• The KIPS Transactions:PartD
• /
• v.14D no.3 s.113
• /
• pp.293-302
• /
• 2007

The study of the web graph yields valuable insight into web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution, also it is useful for understanding the evolution process of web graph and predicting the scale of the Web. In this paper, we report experimental results on properties of the Korea web graph with over 116 million pages and 2.7 billion links. We indicate to study the Korea web properties such as the power law phenomenon and then to analyze the similarity and difference between the global and Korea web graph. Our analysis reveals the Korea web graph have different properties compared with the global web graph from the structure to the evolution of the Web. Finally, a number of measurements of the evolution of the Korea web graph ill be represented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.422-440
• /
• 2005

There are many kinds of research on web graph, most of them are focus on the hyperlinked structure of the web graph. Well known results on the web graph are rich-get-richer phenomenon, small-world phenomenon, scale-free network, etc. In this paper, we define a new directed web graph, so called the Web Usage Pattern Graph (WUPG), that nodes represent web sites and arcs between nodes represent a movement between two sites by users' browsing behavior. The data to constructing the WUPG, approximately 56,000 records, are gathered in the Kyungsung University. The results analysing the data summarized as follows: (i) extremely rich-get-richer phenomenon (ii) average path length between sites is significantly less than the previous one (iii) less external hyperlinks, more internal hyperlinks

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.27-34
• /
• 2010

Web crawlers are fundamental programs which iteratively download web pages by following links of web pages starting from a small set of initial URLs. Previously several web crawling orderings have been proposed to crawl popular web pages in preference to other pages, but some graph search techniques whose characteristics and efficient implementations had been studied in graph theory community have not been applied yet for web crawling orderings. In this paper we consider various graph search techniques including lexicographic breadth-first search, lexicographic depth-first search and maximum cardinality search as well as well-known breadth-first search and depth-first search, and then choose effective web crawling orderings which have linear time complexity and crawl popular pages early. Especially, for maximum cardinality search and lexicographic breadth-first search whose implementations are non-trivial, we propose linear-time web crawling orderings by applying the partition refinement method. Experimental results show that maximum cardinality search has desirable properties in both time complexity and the quality of crawled pages.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.123-129
• /
• 2007

On the Semantic Web, the content of the documents must be explicitly represented through metadata in order to enable contents-based inference. In this study, we propose a mechanism to convert the Conceptual Graph (CG) into Resource Description Framework (RDF). Quite a large number or representation languages for representing knowledge on the Web have been established over the last decade. Most of these researches are focused on design of independent knowledge description. On the Semantic Web, however, a knowledge conversion mechanism will be needed to exchange the knowledge used in independent devices. In this study, the CG could give an entire conceptual view of knowledge and RDF can represent that knowledge on the Semantic Web. Then the CG-based object oriented PROLOG could support the natural inference based on that knowledge. Therefore, our proposed knowledge conversion mechanism will be used in the designing of Semantic Web-based knowledge representation and inference systems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.187-198
• /
• 2005

The structure of a Web site can prevent the search robots or crawling agents from confusion in the midst of huge forest of the Web pages. We formalize the view on the World Wide Web and generalize it as a hierarchy of Web objects such as the Web as a set of Web sites, and a Web site as a directed graph with Web nodes and Web edges. Our approach results in the optimal hierarchical structure that can maximize the weight, tf-idf (term frequency and inverse document frequency), that is one of the most widely accepted content centric measures in the information retrieval community, so that the measure can be used to embody the semantics of search query. The experimental results represent that the optimization model is an effective alternative in the dynamically changing Web environment by replacing conventional heuristic approaches.

• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.149-160
• /
• 2019

Web applications typically interact with databases. Therefore, it is very crucial to understand which web components access which database resources when maintaining web apps. Existing research identifies interactions between Java web components, such as JavaServer Pages and servlets but does not extract dependencies between the web components and database resources, such as tables and attributes. This paper proposes a dynamic analysis of Java web apps, which extracts such dependencies from a Java web app and represents them as a graph. The key responsibility of our analysis method is to identify when web components access database resources. To fulfill this responsibility, our method dynamically observes the database-related objects provided in the Java standard library using the proxy pattern, which can be applied to control access to a desired object. This study also experiments with open source web apps to verify the feasibility of the proposed method.

• The Journal of Society for e-Business Studies
• /
• v.5 no.2
• /
• pp.113-125
• /
• 2000

There are many web-based applications which need graphs and charts to be generated from data stored in the database. This paper does a comparative study on graph processing techniques for web-based applications through a case study of building a stock information system. The result of this paper can be used for building effective web applications with graphs in areas of EC(electronic commerce), EIS(executive information system), and DM(data mining).

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.314-317
• /
• 2006

This study proposes an ontology design framework to support the cooperation among devices by using PROLOG, Conceptual Graph (CG), and Resource Description Framework (RDF). Quite a large number of representation languages for representing ontology on the Web have been established over the last decade. Most of these researches are focused on design of independent resources description. In Semantic Web, however, cooperation ontology will be needed. In this study, the CG could make an entire conceptual view of knowledge and RDF can represent that knowledge. Then the PROLOG could support the natural inference based on that knowledge. Therefore, our proposed ontology will be used in the designing of Semantic Web-based cooperation systems.