• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.133-142
• /
• 2021

Travel pattern recognition is widely used in many aspects such as user trajectory query, user behavior prediction, interest recommendation based on user location, user privacy protection and municipal transportation planning. Because the current recognition accuracy cannot meet the application requirements, the study of travel pattern recognition is the focus of trajectory data research. With the popularization of GPS navigation technology and intelligent mobile devices, a large amount of user mobile data information can be obtained from it, and many meaningful researches can be carried out based on this information. In the current travel pattern research method, the feature extraction of trajectory is limited to the basic attributes of trajectory (speed, angle, acceleration, etc.). In this paper, permutation entropy was used as an eigenvalue of trajectory to participate in the research of trajectory classification, and also used as an attribute to measure the complexity of time series. Velocity permutation entropy and angle permutation entropy were used as characteristics of trajectory to participate in the classification of travel patterns, and the accuracy of attribute classification based on permutation entropy used in this paper reached 81.47%.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.183-189
• /
• 2009

Recently, PCS, PDA and mobile devices, such as the proliferation of spread, GPS (Global Positioning System) the use of, the rapid development of wireless network and a regular user even images, audio, video, multimedia data, such as increased use is for. In particular, video data among multimedia data, unlike the moving object, text or image data that contains information about the movements and changes in the space of time, depending on the kinds of changes that have sigongganjeok attributes. Spatial location of objects on the flow of time, changing according to the moving object (Moving Object) of the continuous movement trajectory of the meeting is called, from the user from the database that contains a given query trajectory and data trajectory similar to the finding of similar trajectory Search (Similar Sub-trajectory Retrieval) is called. To search for the trajectory, and these variations, and given the similar trajectory of the user query (Tolerance) in the search for a similar trajectory to approximate data matching (Approximate Matching) should be available. In addition, a large multimedia data from the database that you only want to be able to find a faster time-effective ways to search different from the existing research is required. To this end, in this paper effectively divided into a grid to search for the trajectory to the trajectory of moving objects, similar to the effective support of the search trajectory offers a new grid-based search techniques.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.233-246
• /
• 2005

To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

• Journal of the Korean Society for Library and Information Science
• /
• v.24
• /
• pp.333-369
• /
• 1993

정보검색 시스템을 대하는 대부분의 이용자의 대답은 '이용하기에 어렵다'라는 것이다. 기계적인 정보검색을 기본 철학으로 하는 기존의 matching paradigm은 정보 곡체를 여기 저기 내용을 옮길 수 있는 물건으로 간주한다. 그리고 기존의 정보시스템은 이용자가 시스템을 구성한 사람의 의도 (즉, indexing, cataloguing rule)를 완전히 이해한다면, 즉 완전하게 질문식(query)을 작성한다면, 효과적인 검색을 할 수 있는 그런 시스템이다. 그러나 어느 이용자가 그 복잡한 시스템을 이해하고 정보검색을 할 수 있겠는가? 한마디로 시스템을 설계한 사람의 의도로 이용자가 적응해서 검색을 한다는 것은 아주 힘든 일이다. 그러나 우리가 이용자에 대한 인식을 다시 한다면 보다 나은 시스템을 만들 수 있다고 본다. 우리 인간은 아주 창조적이어서 자기가 처한 상황에서 이치에 맞게끔 자기 나름대로의 행동을 할 수 있다(sense-making approach). 이 사실을 인식한다면, 왜 이용자들의 행동양식에 시스템 설계자가 적응을 못하는 것인가? 하고 의문을 던질 수 있다. 앞으로의 시스템이 이용자들의 자연스러운 행동 패턴에 맞게 끔 설계된다면 기존의 시스템과 함께 쉽게 이용할 수 있는 편리한 시스템이 설계될 수 있을 것이다. 그러므로 도서관 및 정보학 연구에 있어서 기존의 분류. 목록에 대한 연구와 이용자체에 대한연구(예를 들면, 몇 시에 이용자가 많은가? 어떤 종류의 책을 어떤 계충에서 많이 보는가? 도서 및 잡지가 어떻게 양적으로 성장해 왔는가? 등등의 use study)와 함께 여기서 제시한 제3의 요소인 이용자의 인식(cognition)을 시스템설계에 반드시 도입을 해야만 한다고 본다(user-centric approach). 즉 이용자를 중간 중간에서 도울 수 있는 facilitator가 많이 제공되어야 한다. 이용자의 다양한 패턴의 정보요구(information needs)에 부응할 수 있고, 질문식(query)을 잘 만들 수 없는 이용자를 도울 수 있고(ASK hypothesis: Anomolous State of Knowledge), 어떤 질문식 없이도 자유스럽게 Browsing할 수 있는(예를 들면 hypertext) 시스템을 설계하기 위해서는 눈에 보이는 이용자의 행동패턴(external behavior)도 중요하지만 우리 눈에는 보이지 않는 이용자의 심리상태를 이해한다면 훨씬 나은 시스템을 만들 수 있다. 이용자가 '왜?' '어떤 상황에서,' '어떤 목적으로,' '어떻게,' 정보를 검색하는지에 대해서 새로운 관심을 들려서 이용자들이 얼마나 우리 시스템 설계자들의 의도에 미치지 못한다는 사실을 인식 해야한다. 이 분야의 연구를 위해서는 새로운 paradigm이 필수적으로 필요하다고 본다. 단지 'user-study'만으로는 부족하며 새로운 시각으로 이용자를 연구해야 한다. 가령 새롭게 설치된 computer-assisted system에서 이용자들이 어떻게, 그리핀 어떤 분야에서 왜 그렇게 오류 (error)를 범하는지 분석한다면 앞으로의 computer 시스템 선계에 큰 도움을 줄 수 있을 것으로 믿는다. 실제로 많은 방법이 개발되고 있다. 그러면 시스템 설계자가 가졌던 이용자들이 이러 이러한 방식으로 정보검색을 할 것이라는 예측과(즉, conceptual model) 실제 이용자들이 정보검색을 할 때 일어나는 행동패턴 사이에는(즉, mental model) 상당한 차이점이 있다는 것을 알게 될 것이다. 이 차이점을 줄이는 것이 시스템 설계자의 의무라고 생각한다. 결론적으로, Computer에 대한 새로운 지식과 함께 이용자들의 인식을 연구할 수 있는, 철학적이고 방법론적인 연구를 계속하나가면서, 이용자들의 행동패턴을 어떻게 시스템 설계에 적용할 수 있는 지를 연구해야 한다. 중요하게 인식해야할 사실은 구 Paradigm을 완전히 무시하라는 것은 아니고 단지 이용자에 대한 새로운 인식을 추가하자는 것이다. 그것이 진정한 User Study가 될 수 있는 길이라고 생각하며, 컴퓨터와 이용자 사이의 '원활한 의사교환'이 필수불가결 한 지금 우리 학문이 가야 할 한 연구분야이다. (Human Interaction with Computers)

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.371-380
• /
• 2004

E-commerce is in wide use with the rapid advance of internet technology. The main component of an e-commerce application is a Web-based database application. Currently, it takes a lot of time in developing Web applications since developers should write codes manually or semi-automatically for user interface forms and query processing of an application. Therefore, the productivity increase of Web-based database applications has been demanded. In this paper, we introduce a software tool, which we call the WebSiteGen2, that automatically generates the forms that we used as user interfaces and the EJB/JSP components that process the query made through the forms for an application that needs a new database or uses an existing database. The WebSiteGen2 thus increases the productivity, reusability, expandibility, and portability of an application by automatically generating a 3-tier application based on component technology. Moreover, one user interface form that are generated by the WebSiteGen2 provides information on an interested entity as well as information on all the directly or indirectly related entities with the interested one. In this paper, we explain the functionality and implementation of the WebSiteGen2 and then show the merits by comparing the WebSiteGen2 to the other commercial Web application generators.

• Journal of Internet Computing and Services
• /
• v.12 no.4
• /
• pp.157-172
• /
• 2011

The latest active studies on distributed OLAP to adopt a distributed environment are mainly focused on DHT P2P OLAP and Grid OLAP. However, these approaches have its weak points, the P2P OLAP has limitations to multidimensional range queries in the cloud computing environment due to the nature of structured P2P. On the other hand, the Grid OLAP has no regard for adjacency and time series. It focused on its own sub set lookup algorithm. To overcome the above limits, this paper proposes an efficient central managed P2P approach for a cloud computing environment. When a multi-level hybrid P2P method is combined with an index load distribution scheme, the performance of a multi-dimensional range query is enhanced. The proposed scheme makes the OLAP query results of a user to be able to reused by other users' volatile cube search. For this purpose, this paper examines the combination of an aggregation cube hierarchy tree, a quad-tree, and an interval-tree as an efficient index structure. As a result, the proposed cloud P2P OLAP scheme can manage the adjacency and time series factor of an OLAP query. The performance of the proposed scheme is analyzed by a series of experiments to identify its various characteristics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1657-1670
• /
• 2013

The increase in the number of music files in smart phone and MP3 player makes it difficult to find the music files which people want. So, Query-by-Singing/Humming (QbSH) systems have been developed to retrieve music from a user's humming or singing without having to know detailed information about the title or singer of song. Most previous researches on QbSH have been conducted using musical instrument digital interface (MIDI) files as reference songs. However, the production of MIDI files is a time-consuming process. In addition, more and more music files are newly published with the development of music market. Consequently, the method of using the more common MPEG-1 audio layer 3 (MP3) files for reference songs is considered as an alternative. However, there is little previous research on QbSH with MP3 files because an MP3 file has a different waveform due to background music and multiple (polyphonic) melodies compared to the humming/singing query. To overcome these problems, we propose a new QbSH method using MP3 files on mobile device. This research is novel in four ways. First, this is the first research on QbSH using MP3 files as reference songs. Second, the start and end positions on the MP3 file to be matched are estimated by using multi-layered perceptron (MLP) prior to performing the matching with humming/singing query file. Third, for more accurate results, four MLPs are used, which produce the start and end positions for dynamic time warping (DTW) matching algorithm, and those for chroma-based DTW algorithm, respectively. Fourth, two matching scores by the DTW and chroma-based DTW algorithms are combined by using PRODUCT rule, through which a higher matching accuracy is obtained. Experimental results with AFA MP3 database show that the accuracy (Top 1 accuracy of 98%, with an MRR of 0.989) of the proposed method is much higher than that of other methods. We also showed the effectiveness of the proposed system on consumer mobile device.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.652-657
• /
• 2014

Given a starting point, destination point and various Points Of Interest (POIs), which contain a full or partial order, for a user to visit we wish to create, a sequenced route from the starting point to the destination point that includes one member of each POI type in a particular order. This paper proposes a method for finding the approximate shortest route between the start point, destination point and one member of each POI type. There are currently two algorithms that perform this task but they both have weaknesses. One of the algorithms only considers the distance between the visited POI (or starting point) and POI to visit next. The other algorithm chooses candidate points near the straight-line distance between the start point and destination but does not consider the order of visits on the corresponding network path. This paper outlines an algorithm that chooses the candidate points that are nearer to the network path between the start point and destination using network search. The algorithm looks for routes using the candidate points and finds the approximate shortest route by assigning an adaptive priority to the route that visits more POIs in a short amount of time.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1404-1417
• /
• 1998

Currently, there exists two different methods for database retrieval in the internet. First is to use the search engine and the second is to use the plug-in or ActiveX technology, If a search engine, which makes use of indices built from keywords of simple text data in order to do a search, is used when accessing a database, first it is not possible to access more than one database at a time, second it is also not possible to support various conditional retrievals as in using query language, and third the set of data received might include many unwanted data, in other words, precision rate might be relatively low. Plug in or Active technology make use of Web browset to execute chents' query in order to do a database retrieval. Problems associated with this is that it is not possible to activate more than one DBMS simultaneously even if they are of the same data model. sefond it is not possible to execute a user query other than the ones thai arc previou sly defined by the client program In this paper, to resolve those aforementioned problems we design and implement database retrieval system using a virtual database, which makes it possible to provide direct query jntertacc through the conventional Web browser. We assume that the virtual database is designed and aggregated from more than one relational database using the same data model.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.756-771
• /
• 2003

Digital Video Library System which manages a large amount of multimedia information requires efficient and effective retrieval methods. In this paper, we propose and implement a new video search and retrieval algorithm that compares the query video shot with the video shots in the archives in terms of foreground object, background image, audio, and its context. The foreground object is the region of the video image that has been changed in the successive frames of the shot, the background image is the remaining region of the video image, and the context is the relationship between the low-level features of the adjacent shots. Comparing these features is a result of reflecting the process of filming a moving picture, and it helps the user to submit a query focused on the desired features of the target video clips easily by adjusting their weights in the comparing process. Although the proposed search and retrieval algorithm could not totally reflect the high level semantics of the submitted query video, it tries to reflect the users' requirements as much as possible by considering the context of video clips and by adjusting its weight in the comparing process.