• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.3
• /
• pp.145-152
• /
• 2015

We consider an online selective-sample learning problem for sequence classification, where the goal is to learn a predictive model using a stream of data samples whose class labels can be selectively queried by the algorithm. Given that there is a limit to the total number of queries permitted, the key issue is choosing the most informative and salient samples for their class labels to be queried. Recently, several aggressive selective-sample algorithms have been proposed under a linear model for static (non-sequential) binary classification. We extend the idea to hidden Markov models for multi-class sequence classification by introducing reasonable measures for the novelty and prediction confidence of the incoming sample with respect to the current model, on which the query decision is based. For several sequence classification datasets/tasks in online learning setups, we demonstrate the effectiveness of the proposed approach.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.1-14
• /
• 2007

Character images for the background screen of cell phones are one of the fast growing sectors of the mobile content market. However, character image buyers currently experience tremendous difficulties in searching for desired images due to the awkward image search process. Content-based image retrieval (CBIR) widely used for image retrieval could be a good candidate as a solution to this problem, but it needs to overcome the limitation of the mobile Internet environment where an initial query set (IQS) cannot be easily provided as in the PC-based environment. We propose a new approach, IQS-AutoGen, which automatically generates an initial query set for CBIR on the mobile Internet. The approach applies the collaborative filtering (CF), a well-known recommendation technique, to the CBIR process by using users' preference information collected during the relevance feedback process of CBIR. The results of the experiment using a PC-based prototype system show that the proposed approach successfully satisfies the initial query requirement of CBIR in the mobile Internet environment, thereby outperforming the current image search process on the mobile Internet.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.209-223
• /
• 2000

As the importance and utilization of multimedia data increases, it becomes necessary to represent and manage multimedia data within database systems. In this paper, we designed and implemented an image retrieval system which support efficient management and intelligent retrieval of image data using concept hierarchy and data mining techniques. We stored the image information intelligently in databases using concept hierarchy. To support intelligent retrievals and efficient web services, our system automatically extracts and stores the user information, the user's query information, and the feature data of images. The proposed system integrates user metadata and image metadata to support various retrieval methods on image data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.2
• /
• pp.181-186
• /
• 2012

Recently there has been many active researches on searching similar sequences from data generated with the passage of time. Those data are classified as time series data or sequence data and have different semantics from scalar data of traditional databases. In this paper similar sequence search retrieves sequences that have a similar trend of value changes. At first we have transformed the original sequences by applying DFT. The converted data are more suitable for trend analysis and they require less number of attributes for sequence comparisons. In addition we have developed a region-based query and we applied bitmap indexes which could show better performance in data warehouse. We have built bitmap indexes with varying number of attributes and we have found the least cost query plans for efficient similar sequence searches.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.430-433
• /
• 2007

There have been several researches to manipulate XML Queries efficiently since XML has been accepted in many areas. Among the many of the researches majority of them adopt relational databases as underlying systems because relational model which is used the most widely for managing large data efficiently. In this paper we develop XQuery to SQL Translation Algorithms called XSTAR that can efficiently handle XPath, XQuery FLWORs with nested iteration expressions, element constructors and keywords retrieval on relational database as well as constructing XML fragments from the transformed SQL results. The entire algorithms mentioned in XSTAR have been implemented as the XQuery processor engine in XML management system, XPERT, and we can test and confirm it's prototype from "http ://dblab.kmu.ac.kr/project.jsp".

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.4
• /
• pp.301-307
• /
• 2016

This paper proposes a lyric search method to consider the characteristics of the user query. According to the fact that queries for the lyric search are derived from highlight parts of the music, this paper uses the hierarchical agglomerative clustering to find the highlight and proposes a Gaussian weighting to consider the neighbor of the highlight as well as highlight. By setting the mean of a Gaussian weighting at the highlight, this weighting function has higher weights near the highlight and the lower weights far from the highlight. Then, this paper constructs a index of lyrics with the gaussian weighting. According to the experimental results on a data set obtained from 5 real users, the proposed method is proved to be effective.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.27 no.1
• /
• pp.42-49
• /
• 2017

Studies for efficient information retrieval and reuse of information resources using the ontology techniques are being in progress in various fields. In this paper, we build an ontology to provide a food additive information for consumers given by the KFDA and food safety information portal. Food additives were represented in OWL based knowledge using $Prot{\acute{e}}g{\acute{e}}$. We defined Class, Property, Relationships for providing food additives names, origins, purposes and basic information. In order to retrieve the information of the food additive, we built 679 instances with an ontology, and confirmed the results through DL Query queries. We can expect that the food additives ontology shown in this paper will help the integration and improvement of the information retrieval systems of the related fields in future.

• Journal of Digital Convergence
• /
• v.16 no.12
• /
• pp.335-342
• /
• 2018

The search service, which is a core service of the portal site, presents search queries that are rapidly increasing among the inputted search queries based on the highest instantaneous search frequency, so it is difficult to immediately notify a search query having a high degree of interest for a certain period. Therefore, it is necessary to overcome the above problems and to provide more intelligent information retrieval service by bringing improved analysis results on the change of the search queries. In this paper, we present the criteria for measuring the interest, continuity, and attention of real-time search queries. In addition, according to the criteria, we measure and summarize changes in real-time search queries in hours, days, weeks, and months over a period of time to assess the issues that are of high interest, long-lasting issues of interest, and issues that need attention in the future.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.66-72
• /
• 2003

Toxicogenomics is now emerging as one of the most important genomics application because the toxicity test based on gene expression profiles is expected more precise and efficient than current histopathological approach in pre-clinical phase. One of the challenging points in Toxicogenomics is the construction of intelligent database management system which can deal with very heterogeneous and complex data from many different experimental and information sources. Here we present a new Toxicogenomics database developed as a part of 'Toxicogenomics for Efficient Safety Test (TEST) project'. The TEST database is especially focused on the connectivity of heterogeneous data and intelligent query system which enables users to get inspiration from the complex data sets. The database deals with four kinds of information; compound information, histopathological information, gene expression information, and annotation information. Currently, TEST database has Toxicogenomics information fer 12 molecules with 4 efficacy classes; anti cancer, antibiotic, hypotension, and gastric ulcer. Users can easily access all kinds of detailed information about there compounds and simultaneously, users can also check the confidence of retrieved information by browsing the quality of experimental data and toxicity grade of gene generated from our toxicology annotation system. Intelligent query system is designed for multiple comparisons of experimental data because the comparison of experimental data according to histopathological toxicity, compounds, efficacy, and individual variation is crucial to find common genetic characteristics .Our presented system can be a good information source for the study of toxicology mechanism in the genome-wide level and also can be utilized fur the design of toxicity test chip.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1676-1689
• /
• 2014

At present, the Content-Based Image Retrieval (CBIR) system has become a hot research topic in the computer vision field. In the CBIR system, the accurate extractions of low-level features can reduce the gaps between high-level semantics and improve retrieval precision. This paper puts forward a new retrieval method aiming at the problems of high computational complexities and low precision of global feature extraction algorithms. The establishment of the new retrieval method is on the basis of the SIFT and Harris (APISH) algorithm, and the salient region of interest points (SRIP) algorithm to satisfy users' interests in the specific targets of images. In the first place, by using the IPDSH and SRIP algorithms, we tested stable interest points and found salient regions. The interest points in the salient region were named as salient interest points. Secondary, we extracted the pseudo-Zernike moments of the salient interest points' neighborhood as the feature vectors. Finally, we calculated the similarities between query and database images. Finally, We conducted this experiment based on the Caltech-101 database. By studying the experiment, the results have shown that this new retrieval method can decrease the interference of unstable interest points in the regions of non-interests and improve the ratios of accuracy and recall.