• Title/Summary/Keyword: Query analysis

Search Result 460, Processing Time 0.024 seconds

The Effect of Deal-Proneness in the Searching Pattern on the Purchase Probability of Customer in Online Travel Services (소비자 키워드광고 탐색패턴에 나타난 촉진지향성이 온라인 여행상품 구매확률에 미치는 영향)

  • Kim, Hyun Gyo;Lee, Dong Il
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.39 no.1
    • /
    • pp.29-48
    • /
    • 2014
  • The recent keyword advertising does not reflect the individual customer searching pattern because it is focused on each keyword at the aggregate level. The purpose of this research is to observe processes of customer searching patterns. To be specific, individual deal-proneness is mainly concerned. This study incorporates location as a control variable. This paper examines the relationship between customers' searching patterns and probability of purchase. A customer searching session, which is the collection of sequence of keyword queries, is utilized as the unit of analysis. The degree of deal-proneness is measured using customer behavior which is revealed by customer searching keywords in the session. Deal-proneness measuring function calculates the discount of deal prone keyword leverage in accordance with customer searching order. Location searching specificity function is also calculated by the same logic. The analyzed data is narrowed down to the customer query session which has more than two keyword queries. The number of the data is 218,305 by session, which is derived from Internet advertising agency's (COMAS) advertisement managing data and the travel business advertisement revenue data from advertiser's. As a research result, there are three types of the deal-prone customer. At first, there is an unconditional active deal-proneness customer. It is the customer who has lower deal-proneness which means that he/she utilizes deal-prone keywords in the last phase. He/she starts searching a keyword like general ones and then finally purchased appropriate products by utilizing deal-prone keywords in the last time. Those two types of customers have the similar rates of purchase. However, the last type of the customer has middle deal-proneness; who utilizes deal-prone keywords in the middle of the process. This type of a customer closely gets into the information by employing deal-prone keywords but he/she could not find out appropriate alternative then would modify other keywords to look for other alternatives. That is the reason why the purchase probability in this case would be decreased Also, this research confirmed that there is a loyalty effect using location searching specificity. The customer who has higher trip loyalty for specificity location responds to selected promotion rather than general promotion. So, this customer has a lower probability to purchase.

Cluster-based P2P scheme considering node mobility in MANET (MANET에서 장치의 이동성을 고려한 클러스터 기반 P2P 알고리즘)

  • Wu, Hyuk;Lee, Dong-Jun
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.6
    • /
    • pp.1015-1024
    • /
    • 2011
  • Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.

Application of Geographic Information Systems for Effective Management of University Forests (대학연습림의 효율적 관리를 위한 지리정보시스템의 활용방안)

  • Kwon, Taeho;Kim, Taekyun
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.2 no.3
    • /
    • pp.81-90
    • /
    • 1999
  • The functional change of university forest have led to need more complicated techniques for forest management strategies, and more information about forest and natural environment. Therefore the systematic tools, like the so-called Forest Information System to which apply the techniques of geographic information system, are eagerly required for collecting, editing, managing, analyzing the various data about forest and environment, and for supporting the decision-making process. The digital mapping, which could be a primary step to construct the Forest Information System, was carried out using the many kinds of thematic spatial data referring to the Seongju Experimental Forest of Taegu University. As a result, various digital maps including forest type, soil type and so on were constructed. And then we made an user-interface system to link the attributive data in management plan to the thematic spatial data. This system was regarded as the effective tool capable of the more rapid query, analysis and update of related data for systematic management of university forest. Moreover, it would be a useful tool of decision-making in devising, assessing and operating the plan of forest management and development. But there would be much room for supplementation and improvement to make the more convenient and powerful system for the external demands, therefore more concerns and efforts in collecting, revising and updating the data is continuously required.

  • PDF

Exploring Secondary Students' Dialogic Argumentation Regarding Excretion via Collaborative Modeling (배설에 대한 협력적 모델링 과정에서 나타난 중학교 학생들의 대화적 논변활동 탐색)

  • Lee, Shinyoung;Kim, Hui-Baik
    • Journal of The Korean Association For Science Education
    • /
    • v.37 no.6
    • /
    • pp.1037-1049
    • /
    • 2017
  • The purpose of this study is to explore how the flow of discourse move and their reasoning process in dialogic argumentation during group modeling on excretion. Five groups of three to four students in the second grade of a middle school participated in the modeling practice of a Gifted Center. Analysis was conducted on argumentation during the modeling activity in which students should explain how the waste product (ammonia) leaves the body. It was found that there was a sequential argumentative process-tentative consensus, solving the uncertainty, and consensus. There were several discourse moves - 'claim' and 'counterclaim' in the stage of tentative consensus, 'query' and 'clarification of meaning' in the stage of solving the uncertainty, and 'change of claim' in the stage of consensus. Students participated in the dialogic argumentation by constructing argument collaboratively for reaching a consensus. Critical questioning in the stage of solving the uncertainty and reasoning in the stage of consensus were the impact factors of dialogic argumentation. By answering the critical questions, students changed their claims or suggested new claims by defending or rebutting previous claims. Students justified group claims with diverse argumentation scheme and scientific reasoning to reach a group consensus. These findings have implication for science educators who want to adopt dialogic argumentation in science classes.

Gramene database: A resource for comparative plant genomics, pathways and phylogenomics analyses

  • Tello-Ruiz, Marcela K.;Stein, Joshua;Wei, Sharon;Preece, Justin;Naithani, Sushma;Olson, Andrew;Jiao, Yinping;Gupta, Parul;Kumari, Sunita;Chougule, Kapeel;Elser, Justin;Wang, Bo;Thomason, James;Zhang, Lifang;D'Eustachio, Peter;Petryszak, Robert;Kersey, Paul;Lee, PanYoung Koung;Jaiswal, kaj;Ware, Doreen
    • Proceedings of the Korean Society of Crop Science Conference
    • /
    • 2017.06a
    • /
    • pp.135-135
    • /
    • 2017
  • The Gramene database (http://www.gramene.org) is a powerful online resource for agricultural researchers, plant breeders and educators that provides easy access to reference data, visualizations and analytical tools for conducting cross-species comparisons. Learn the benefits of using Gramene to enrich your lectures, accelerate your research goals, and respond to your organismal community needs. Gramene's genomes portal hosts browsers for 44 complete reference genomes, including crops and model organisms, each displaying functional annotations, gene-trees with orthologous and paralogous gene classification, and whole-genome alignments. SNP and structural diversity data, available for 11 species, are displayed in the context of gene annotation, protein domains and functional consequences on transcript structure (e.g., missense variant). Browsers from multiple species can be viewed simultaneously with links to community-driven organismal databases. Thus, while hosting the underlying data for comparative studies, the portal also provides unified access to diverse plant community resources, and the ability for communities to upload and display private data sets in multiple standard formats. Our BioMart data mining interface enable complex queries and bulk download of sequence, annotation, homology and variation data. Gramene's pathway portal, the Plant Reactome, hosts over 240 pathways curated in rice and inferred in 66 additional plant species by orthology projection. Users may compare pathways across species, query and visualize curated expression data from EMBL-EBI's Expression Atlas in the context of pathways, analyze genome-scale expression data, and conduct pathway enrichment analysis. Our integrated search database and modern user interface leverage these diverse annotations to facilitate finding genes through selecting auto-suggested filters with interactive views of the results.

  • PDF

Cache Replacement Strategies considering Location and Region Properties of Data in Mobile Database Systems (이동 데이타베이스 시스템에서 데이타의 위치와 영역 특성을 고려한 캐쉬 교체 기법)

  • Kim, Ho-Sook;Yong, Hwan-Seung
    • Journal of KIISE:Databases
    • /
    • v.27 no.1
    • /
    • pp.53-63
    • /
    • 2000
  • The mobile computing service market is increasing rapidly due to the development of low-cost wireless network technology and the high-performance mobile computing devices. In recent years, several methods have been proposed to effectively deal with restrictions of the mobile computing environment such as limited bandwidth, frequent disconnection and short-lived batteries. Amongst those methods, much study is being done on the caching method - among the data transmitted from a mobile support station, it selects those that are likely to be accessed in the near future and stores them in the local cache of a mobile host. Existing cache replacement methods have some limitations in efficiency because they do not take into consideration the characteristics of user mobility and spatial attributes of geographical data. In this paper, we show that the value and the semantic of the data, which are stored in the cache of a mobile host, changes according to the movement of the mobile host. We argue it is because data that are geographically near are better suited to provide an answer to a users query in the mobile environment. Also, we define spatial location of geographical data has effect on, using the spatial attributes of data. Finally, we propose two new cache replacement methods that efficiently support user mobility and spatial attributes of data. One is based on the location of data and the other on the meaningful region of data. From the comparative analysis of the previous methods and that they improve the cache hit ratio. Also we show that performance varies according to data density using this, we argue different cache replacement methods are required for regions with varying density of data.

  • PDF

Design and Implementation of a Question Management System based on a Concept Lattice (개념 망 구조를 기반으로 한 문항 관리 시스템의 설계 및 구현)

  • Kim, Mi-Hye
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.11
    • /
    • pp.412-425
    • /
    • 2008
  • One of the important elements for improving academic achievement of learners in education through e-learning is to support learners to study by finding questions they want with providing various evaluation questions. However, most of question retrieval systems usually depend on keyword search based on only a syntactical analysis and/or a hierarchical browsing system classified by the topics of subjects. In such a system it is not easy to find integrative questions associated with each other. In order to improve this problem, in this paper we proposed a question management and retrieval system which allows users to easily manage questions and also to effectively find questions for study on the Web. Then, we implemented a system that gives to access questions for the domain of C language programming. The system makes it possible to easily search questions related to not only a single theme but also questions integrated by interrelationship between topics and questions. This is done by supporting to be able to retrieve questions according to conceptual interrelationships between questions from user query. Consequently, it is expected that the proposed system will provide learners to understand the basic theories and the concepts of the subjects as well as to improve the ability of comprehensive knowledge utilization and problem-solving.

Performance Comparison of Column-Oriented and Row-Oriented Database Systems for Star Schema Join Processing (스타 스키마 조인 처리에 대한 세로-지향 데이터베이스 시스템과 가로-지향 데이터베이스 시스템의 성능 비교)

  • Oh, Byung-Jung;Ahn, Soo-Min;Kim, Kyung-Chang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.8
    • /
    • pp.29-38
    • /
    • 2011
  • Unlike in traditional row-oriented database systems, a column-oriented database system stores data in column-oriented and not row-oriented order. Recently, research results revealed the effectiveness of column-oriented databases for applications such as data warehouse and decision support systems that access large volumes of data in a read only manner. In this paper, we investigate the join strategies for column-oriented databases and prove the effectiveness of column-oriented databases in data warehouse systems. For unbiased comparison, the two database systems are analyzed using the star schema benchmark and the performance analysis of a star schema join query is carried out. We experimented with well-known join algorithms and considered early materialization and late materialization join strategies for column-oriented databases. The performance results confirm that star schema join queries perform better in terms of disk I/O cost in column-oriented databases than in row-oriented databases. In addition, the late materialization strategy showed more performance gain than the early materialization strategy in column-oriented databases.

Development of Personalized Recommendation System using RFM method and k-means Clustering (RFM기법과 k-means 기법을 이용한 개인화 추천시스템의 개발)

  • Cho, Young-Sung;Gu, Mi-Sug;Ryu, Keun-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.163-172
    • /
    • 2012
  • Collaborative filtering which is used explicit method in a existing recommedation system, can not only reflect exact attributes of item but also still has the problem of sparsity and scalability, though it has been practically used to improve these defects. This paper proposes the personalized recommendation system using RFM method and k-means clustering in u-commerce which is required by real time accessablity and agility. In this paper, using a implicit method which is is not used complicated query processing of the request and the response for rating, it is necessary for us to keep the analysis of RFM method and k-means clustering to be able to reflect attributes of the item in order to find the items with high purchasablity. The proposed makes the task of clustering to apply the variable of featured vector for the customer's information and calculating of the preference by each item category based on purchase history data, is able to recommend the items with efficiency. To estimate the performance, the proposed system is compared with existing system. As a result, it can be improved and evaluated according to the criteria of logicality through the experiment with dataset, collected in a cosmetic internet shopping mall.

Broadcast Method based on Data Access Frequencies and Semantic Relationships in Mobile Computing Environments (이동컴퓨팅 환경에서 데이타의 접근빈도 및 시맨틱 관계를 고려한 방송 방법)

  • 최성환;정성원;이송이
    • Journal of KIISE:Databases
    • /
    • v.30 no.5
    • /
    • pp.476-493
    • /
    • 2003
  • Data broadcast is an effective data transmission method from a data base server to numerous mobile clients due to the restrictions on mobile environment such as low wireless communication bandwidth and energy shortage of mobile devices. There are various broadcast methods based on clients' data access frequencies or semantic relationship of data. The broadcast schedule based only on the access frequencies does not consider semantic relations of data, so that when a client needs to access a series of semantically related data, the client has to listen to the wireless channel for a long time. On the other hand, the broadcast schedule based only on semantic relationship of data makes data access time longer when clients highly request specific data which are not semantically related but frequently accessed. In this paper, we present an efficient data broadcast method based on not only data access frequencies but also semantic relationship to improve mobile clients' query response time. The new hybrid broadcast method we propose creates a data broadcast schedule according to the data access frequencies and then the schedule is adjusted to reflect semantic relationship of data. We show our method is efficient by experimental performance analysis.