• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.766-772
• /
• 2007

As XML is widely used, many researches on the XML storage and query processing have been done. But, previous works on path query processing have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. Those researches did not efficiently process partial match queries on the differently-structured document set. To resolve the problem, we suggested a new index structure using relational table. The method constructs the $B^+$-tree index using backward label paths instead of forward label paths used in previous researches for storing path information and allows for finding the label paths that match the partial match queries efficiently using it when process the queries.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.2
• /
• pp.180-185
• /
• 2015

As the number of document resources is continuously increasing, automatically extracting keyphrases from a document becomes one of the main issues in recent days. However, most previous works have tried to extract keyphrases from words in documents, so they overlooked latent keyphrases which did not appear in documents. Although latent keyphrases do not appear in documents, they can undertake an important role in text summarization and information retrieval because they implicate meaningful concepts or contents of documents. Also, they cover more than one fourth of the entire keyphrases in the real-world datasets and they can be utilized in short articles such as SNS which rarely have explicit keyphrases. In this paper, we propose a new approach that selects candidate keyphrases from the keyphrases of neighbor documents which are similar to the given document and evaluates the importance of the candidates with the individual words in the candidates. Experiment result shows that latent keyphrases can be extracted at a reasonable level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.549-561
• /
• 2005

As Internet and network technologies have been developed, e-commerces are getting more complex and more various. This paper, for meta-data and data exchange between heterogeneous database systems, uses XML schema proposed in W3C, and XML schema can present meta-data and data of relational database system as XML document format which is structural. It supports various primitive data formats, so that it uses the structure which reflects adequately data formats which relational database system offered. However, current e-commerces use heterogeneous platforms, so difficulties that is mutual interchange and management exist. For the solution for these problems, a standard ontology which defines relations of product classifications and the standard of property expression and the location ontology which offers e-commerce's information about products are constructed. Applying these ontology information to search system, by offering information which customers need efficient search is performed. Combining these ontologies and product classification category information, called XMDR, this XMDR is introduced into product search system, so this paper proposes to construct ontology server method for efficient search.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.95-105
• /
• 2006

This paper proposes a novel approach to represent the image by using shape descriptor having an information of area. The proposed descriptor is a set of vectors, consists of radius, area and direction parameters in the concentrated center point. Due to the area parameter, we know our descriptor can obtain the information of area. Also, we give an extended shape descriptor to get more detailed representation. To do this, we move the center point of our vision to that point for region of interest. By doing so about all of region of interest, we can get our descriptor for detailed information of the image. From more detailed descriptor, it's natural that it's more efficient fur representation, retrievals and so on. We make it the normalized pattern and expand to improve its quality. The proposed method is invariant to scale, position and rotation. The results show that it can be used efficiently for image representation as we can see in retrievals of silhouette images.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.6
• /
• pp.141-152
• /
• 2011

Growing efforts and interests of security techniques in a diverse surveillance environment, the intelligent surveillance system, which is capable of automatically detecting and tracking target objects in multi-cameras environment, is actively developing in a security community. In this paper, we propose an effective visual surveillance system that is avaliable to track objects continuously in multiple non-overlapped cameras. The proposed object tracking scheme consists of object tracking module and tracking management module, which are based on hand-off scheme and protocol. The object tracking module, runs on IP camera, provides object tracking information generation, object tracking information distribution and similarity comparison function. On the other hand, the tracking management module, runs on video control server, provides realtime object tracking reception, object tracking information retrieval and IP camera control functions. The proposed object tracking scheme allows comprehensive framework that can be used in a diverse range of application, because it doesn't rely on the particular surveillance system or object tracking techniques.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.31-41
• /
• 2009

In the Semantic Web, it is possible to provide intelligent information retrieval and automated web services by defining a concept of information resource and representing a semantic relation between resources with meta data and ontology. It is very important to manage semantic data such as ontology and meta data efficiently for implementing essential functions of the Semantic Web. Thus we propose an index structure to support more accurate search results and efficient query processing by considering semantic and structural features of the semantic data. Especially we use a graph data model to express semantic and structural features of the semantic data and process various type of queries by using graph model based path expressions. In this paper the proposed index aims to distinguish our approach from earlier studies and involve the concept of the Semantic Web in its entirety by querying on primarily extracted structural path information and secondary extracted one through semantic inferences with ontology. In the experiments, we show that our approach is more accurate and efficient than the previous approaches and can be applicable to various applications in the Semantic Web.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.85-100
• /
• 2003

Today's computing system has expanded its application to business trade and distributed work transactions using the Internet. As the demand for more flexible, adaptable, extensible, and robust web-based enterprise, these application development has been gradually expanded based on reusable, independent, and portable components. Component Based Development (CBD) works by developing and evolving software from selected reusable software components and then assembling them within appropriate software architecture. However, it requires an increase in cost to build new components as well as the necessary effort to develop of the business requirement these components. Standardized component models are required as well from the perspective of systems in order to support rapid and exact component information transmission on the web. In this paper, we describe the e-Business Component Development with agent for rapid application development on the web that correspond to the demands of users in the business domain. We design and implement the specifications of e-business components by combining these demands. In order to improve the agent register and retrieval, we propose the intelligent search and register agents, which can conduct more precise searching and specializing for components. The system enables the locating of user's frequently used components through an agent involving register and retrieval, as well as rapid procedures for registers The e-BCOS (e-Business Component System) is the agent system for the user to register distributed components and to search for components Information. The e-BCOS increases reusability through the e-business component development of distributed components in the business domain. For the share and delivery, specification with XML is acceptable to user's variable order e-BCOS Includes the effective investment, timeliness, reliability, efficiency, and maintenance effort by with agent.

• Journal of Intelligence and Information Systems
• /
• v.7 no.1
• /
• pp.149-159
• /
• 2001

There have been lots of researches for providing a personalized service to a customer using one-to-one marketing and collaborative filtering techniques in E-Commerce. However, there are technical difficulties for providing the recommendation of products far users, which often involve high complexity of computation. In this paper, we have presented an integrated method of classification problem solving method and constraint based configuration techniques. This method can reduce a complexity of computation by classifying a solution domain space that has a higher complexity of composition. Thereafter, we have modeled customers constraints and the components of products to configure a complete system by passing it to constraint processing module in Constraint Satisfaction Problems. Constraint-based configuration uses the constraint propagation using the constraints of buyers and the constraints among PC components to configure a proper product for a customer. We have transformed and applied vector space modeling method in the field of information retrieval to consider a customer satisfaction in addition to the CSP. Finally, we have applied our system to test data fur evaluating a customers satisfaction and performance of the proposed system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.812-820
• /
• 2012

In this paper, multiple pedestrians tracking system using Histogram of Oriented Gradient and occlusion detection is proposed. The proposed system is applicable to Intelligent Surveillance System. First, we detect pedestrian in a image sequence using pedestrian's feature. To get pedestrian's feature, we make block-histogram using gradient's direction histogram based on HOG(Histogram of Oriented Gradient), after that a pedestrian region is classified by using Linear-SVM(Support Vector Machine) training. Next, moving objects are tracked by using position information of the classified pedestrians. And we create motion trajectory descriptor which is used for content based event retrieval. The experimental results show that the proposed method is more fast, accurate and effective than conventional methods.

• Journal of Intelligence and Information Systems
• /
• v.16 no.4
• /
• pp.21-41
• /
• 2010

This paper proposes a system that can serve users with appropriate search results through real time filtering, and implemented adaptive user profiling based personalized information retrieval system(PIRS) using users' implicit feedbacks in order to deal with the problem of existing search systems such as Google or MSN that does not satisfy various user' personal search needs. One of the reasons that existing search systems hard to satisfy various user' personal needs is that it is not easy to recognize users' search intentions because of the uncertainty of search intentions. The uncertainty of search intentions means that users may want to different search results using the same query. For example, when a user inputs "java" query, the user may want to be retrieved "java" results as a computer programming language, a coffee of java, or a island of Indonesia. In other words, this uncertainty is due to ambiguity of search queries. Moreover, if the number of the used words for a query is fewer, this uncertainty will be more increased. Real-time filtering for search results returns only those results that belong to user-selected domain for a given query. Although it looks similar to a general directory search, it is different in that the search is executed for all web documents rather than sites, and each document in the search results is classified into the given domain in real time. By applying information filtering using real time directory classifying technology for search results to personalization, the number of delivering results to users is effectively decreased, and the satisfaction for the results is improved. In this paper, a user preference profile has a hierarchical structure, and consists of domains, used queries, and selected documents. Because the hierarchy structure of user preference profile can apply the context when users perfomed search, the structure is able to deal with the uncertainty of user intentions, when search is carried out, the intention may differ according to the context such as time or place for the same query. Furthermore, this structure is able to more effectively track web documents search behaviors of a user for each domain, and timely recognize the changes of user intentions. An IP address of each device was used to identify each user, and the user preference profile is continuously updated based on the observed user behaviors for search results. Also, we measured user satisfaction for search results by observing the user behaviors for the selected search result. Our proposed system automatically recognizes user preferences by using implicit feedbacks from users such as staying time on the selected search result and the exit condition from the page, and dynamically updates their preferences. Whenever search is performed by a user, our system finds the user preference profile for the given IP address, and if the file is not exist then a new user preference profile is created in the server, otherwise the file is updated with the transmitted information. If the file is not exist in the server, the system provides Google' results to users, and the reflection value is increased/decreased whenever user search. We carried out some experiments to evaluate the performance of adaptive user preference profile technique and real time filtering, and the results are satisfactory. According to our experimental results, participants are satisfied with average 4.7 documents in the top 10 search list by using adaptive user preference profile technique with real time filtering, and this result shows that our method outperforms Google's by 23.2%.