• Title/Summary/Keyword: Semantic Values

Search Result 136, Processing Time 0.032 seconds

An interactive image retrieval system: from symbolic to semantic

  • Lan Le Thi;Boucher Alain
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.427-434
    • /
    • 2004
  • In this paper, we present a overview of content-based image retrieval (CBIR) systems: its results and its problems. We propose our CBIR system currently based on color and texture. From the CBIR systems. we discuss the way to add semantic values in image retrieval systems. There are 3 ways for adding them: concept definition, machine learning and man-machine interaction. Along with this we introduce our preliminary results and discuss them in the goal of reaching semantic retrieval. Different result representation schemes are presented. At last, we present our work to build a complete annotated image database and our image annotaion program.

  • PDF

Relaxing Queries by Combining Knowledge Abstraction and Semantic Distance Approach (지식 추상화와 의미 거리 접근법을 통합한 질의 완화 방법론)

  • Shin, Myung-Keun;Park, Sung-Hyuk;Lee, Woo-Key;Huh, Soon-Young
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.1
    • /
    • pp.125-136
    • /
    • 2007
  • The study on query relaxation which provides approximate answers has received attention. In recent years, some arguments have been made that semantic relationships are useful to present the relationships among data values and calculating the semantic distance between two data values can be used as a quantitative measure to express relative distance. The aim of this article is a hierarchical metricized knowledge abstraction (HiMKA) with an emphasis on combining data abstraction hierarchy and distance measure among data values. We propose the operations and the query relaxation algorithm appropriate to the HiMKA. With various experiments and comparison with other method, we show that the HiMKA is very useful for the quantified approximate query answering and our result is to offer a new methodological framework for query relaxation.

Semantic Process Retrieval with Similarity Algorithms (유사도 알고리즘을 활용한 시맨틱 프로세스 검색방안)

  • Lee, Hong-Joo;Klein, Mark
    • Asia pacific journal of information systems
    • /
    • v.18 no.1
    • /
    • pp.79-96
    • /
    • 2008
  • One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching for expanding results from an exact matching engine to query the OWL(Web Ontology Language) MIT Process Handbook. MIT Process Handbook is an electronic repository of best-practice business processes. The Handbook is intended to help people: (1) redesigning organizational processes, (2) inventing new processes, and (3) sharing ideas about organizational practices. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. Many previous studies devised artificial dataset composed of randomly generated numbers without real meaning and used subjective ratings for correct answers and similarity values between processes. To generate a semantic-preserving test data set, we create 20 variants for each target process that are syntactically different but semantically equivalent using mutation operators. These variants represent the correct answers of the target process. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We use simple similarity algorithms for text retrieval such as TF-IDF and Levenshtein edit distance to devise our approaches, and utilize tree edit distance measure because semantic processes are appeared to have a graph structure. Also, we design similarity algorithms considering similarity of process structure such as part process, goal, and exception. Since we can identify relationships between semantic process and its subcomponents, this information can be utilized for calculating similarities between processes. Dice's coefficient and Jaccard similarity measures are utilized to calculate portion of overlaps between processes in diverse ways. We perform retrieval experiments to compare the performance of the devised similarity algorithms. We measure the retrieval performance in terms of precision, recall and F measure? the harmonic mean of precision and recall. The tree edit distance shows the poorest performance in terms of all measures. TF-IDF and the method incorporating TF-IDF measure and Levenshtein edit distance show better performances than other devised methods. These two measures are focused on similarity between name and descriptions of process. In addition, we calculate rank correlation coefficient, Kendall's tau b, between the number of process mutations and ranking of similarity values among the mutation sets. In this experiment, similarity measures based on process structure, such as Dice's, Jaccard, and derivatives of these measures, show greater coefficient than measures based on values of process attributes. However, the Lev-TFIDF-JaccardAll measure considering process structure and attributes' values together shows reasonably better performances in these two experiments. For retrieving semantic process, we can think that it's better to consider diverse aspects of process similarity such as process structure and values of process attributes. We generate semantic process data and its dataset for retrieval experiment from MIT Process Handbook repository. We suggest imprecise query algorithms that expand retrieval results from exact matching engine such as SPARQL, and compare the retrieval performances of the similarity algorithms. For the limitations and future work, we need to perform experiments with other dataset from other domain. And, since there are many similarity values from diverse measures, we may find better ways to identify relevant processes by applying these values simultaneously.

A Text Similarity Measurement Method Based on Singular Value Decomposition and Semantic Relevance

  • Li, Xu;Yao, Chunlong;Fan, Fenglong;Yu, Xiaoqiang
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.863-875
    • /
    • 2017
  • The traditional text similarity measurement methods based on word frequency vector ignore the semantic relationships between words, which has become the obstacle to text similarity calculation, together with the high-dimensionality and sparsity of document vector. To address the problems, the improved singular value decomposition is used to reduce dimensionality and remove noises of the text representation model. The optimal number of singular values is analyzed and the semantic relevance between words can be calculated in constructed semantic space. An inverted index construction algorithm and the similarity definitions between vectors are proposed to calculate the similarity between two documents on the semantic level. The experimental results on benchmark corpus demonstrate that the proposed method promotes the evaluation metrics of F-measure.

The Associational Meaning of Purple-series Color Names in the Clothing of Joseon Dynasty Period (조선시대 복식에 나타난 자색계 색명의 연상적 의미)

  • Kim Soon-Young
    • Journal of the Korean Society of Costume
    • /
    • v.55 no.3 s.93
    • /
    • pp.1-18
    • /
    • 2005
  • In this study, the transition characteristics of purple series color names appearing in the clothing of the Joseon Dynasty were examined, and the associational meaning of each name were investigated through various methods. The results are as follows; First, Such characteristics as continuity, differentiation, substitution could be observed through the investigation of color names of purple-series appeared on the clothing in the Joseon Dynasty period. Secondly, the associational meaning could be subdivided into; social position symbolic meanings, usage meanings, economic meanings, and thought meanings. The social position symbolic meanings could be observed mainly in the single names which has been used since the ancient times, usage meanings could be observed in a wide variety according to the individual color names. The economic meanings could be observed by comparing the value of colored cloths and colored threads. The thought meanings were mainly related with the Confucianism. Thirdly, the associational semantic structure were established on the basis of associational meanings of purple-series color names. Individual color name on the social position symbolic semantic structure symbolizes [government official] and [servant]. Through usage semantic structure individual color names could be understood structurally according to the social position, sex distinction, wearing situation, items of clothing, and structure of clothing. Individual names on the economic semantic structure were segmented by the semantic components of the values in [high], [medium], [low] prices, kinds and quantity of dyes. The thought semantic structure could be subdivided [Confucianism] and [The Thought of Taeil] in its semantic structure.

Analyzing the Structure of Science Gifted and General Middle School Students' Values of Career: Social Network Approach (중학교 과학영재학생과 일반학생들의 직업가치관 구조분석: 사회네트워크적 접근)

  • Shin, Sein;Lee, Jun-Ki;Ha, Minsu;Lee, Tae-Kyong;Jung, Young-Hee
    • Journal of Gifted/Talented Education
    • /
    • v.25 no.2
    • /
    • pp.195-216
    • /
    • 2015
  • Students' perceived values of career play a core role in formation of their career motivation. In particular, science gifted students should build sound values of career in science and technology so that our society can retain the human resources for future science and technology. This study compared and analyzed the structure of science gifted and general middle school students' preferred job and values of career using semantic network analysis. Methodologically, we first collected science gifted and general middle school students' preferred careers and the reasons of the career choice using survey method. Then, we structuralize semantic networks of students' perceived values of their preferred careers using semantic network analysis. We identified the characters of networks that two different student groups showed based on the structure matrix indices of semantic network analysis. Findings revealed that science gifted students considered the creativeness as the most important value of career. Second, science gifted students considered more diverse values of career than general students. Third, science gifted students considered the self-realization such as displaying capability as a core value of career in STEM and medical science whereas general students considered the community service as a core value of the careers. This study identified the significant differences between science gifted and general middle school students' values of careers. The structures of students perceived values of careers can be used for teachers to counsel their students about students' future careers.

Document Clustering Using Semantic Features and Fuzzy Relations

  • Kim, Chul-Won;Park, Sun
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.3
    • /
    • pp.179-184
    • /
    • 2013
  • Traditional clustering methods are usually based on the bag-of-words (BOW) model. A disadvantage of the BOW model is that it ignores the semantic relationship among terms in the data set. To resolve this problem, ontology or matrix factorization approaches are usually used. However, a major problem of the ontology approach is that it is usually difficult to find a comprehensive ontology that can cover all the concepts mentioned in a collection. This paper proposes a new document clustering method using semantic features and fuzzy relations for solving the problems of ontology and matrix factorization approaches. The proposed method can improve the quality of document clustering because the clustered documents use fuzzy relation values between semantic features and terms to distinguish clearly among dissimilar documents in clusters. The selected cluster label terms can represent the inherent structure of a document set better by using semantic features based on non-negative matrix factorization, which is used in document clustering. The experimental results demonstrate that the proposed method achieves better performance than other document clustering methods.

RELATIONSHIP BETWEEN FABRIC SOUND PARAMETERS AND SUBJECTIVE SENSATION

  • Yi, Eunjou;Cho, Gilsoo
    • Proceedings of the Korean Society for Emotion and Sensibility Conference
    • /
    • 2000.04a
    • /
    • pp.138-143
    • /
    • 2000
  • In order to investigate the relationship between fabric sound parameters and subjective sensation, each sound from 60 fabrics was recorded and analyzed by Fast Fourier transform. Level pressure of total sound (LPT), three coefficients (ARC, ARF, ARE) of auto regressive models, loudness (Z), and sharpness (Z) by Zwickers model were estimated as sound parameters. For subjective evaluation, seven sensation (softness, loudness, sharpness, clearness, roughness, highness, and pleasantness) was rated by both semantic differential scale (SDS) and free modulus magnitude estimation (FMME). As the results, the ARC values were positively proportional to both LPT and loudness (Z) values. In both of SDS and FMME, softness, clearness, and pleasantness were negatively correlated with loudness, sharpness, roughness, and highness. In regression models, softness and clearness by FMME were negatively affected by LPT뭉 ARC, while loudness, sharpness, roughness, and highness were positively expected. Regression models for pleasantness showed low values for R2.

  • PDF

The Strength of the Relationship between Semantic Similarity and the Subcategorization Frames of the English Verbs: a Stochastic Test based on the ICE-GB and WordNet (영어 동사의 의미적 유사도와 논항 선택 사이의 연관성 : ICE-GB와 WordNet을 이용한 통계적 검증)

  • Song, Sang-Houn;Choe, Jae-Woong
    • Language and Information
    • /
    • v.14 no.1
    • /
    • pp.113-144
    • /
    • 2010
  • The primary goal of this paper is to find a feasible way to answer the question: Does the similarity in meaning between verbs relate to the similarity in their subcategorization? In order to answer this question in a rather concrete way on the basis of a large set of English verbs, this study made use of various language resources, tools, and statistical methodologies. We first compiled a list of 678 verbs that were selected from the most and second most frequent word lists from the Colins Cobuild English Dictionary, which also appeared in WordNet 3.0. We calculated similarity measures between all the pairs of the words based on the 'jcn' algorithm (Jiang and Conrath, 1997) implemented in the WordNet::Similarity module (Pedersen, Patwardhan, and Michelizzi, 2004). The clustering process followed, first building similarity matrices out of the similarity measure values, next drawing dendrograms on the basis of the matricies, then finally getting 177 meaningful clusters (covering 437 verbs) that passed a certain level set by z-score. The subcategorization frames and their frequency values were taken from the ICE-GB. In order to calculate the Selectional Preference Strength (SPS) of the relationship between a verb and its subcategorizations, we relied on the Kullback-Leibler Divergence model (Resnik, 1996). The SPS values of the verbs in the same cluster were compared with each other, which served to give the statistical values that indicate how much the SPS values overlap between the subcategorization frames of the verbs. Our final analysis shows that the degree of overlap, or the relationship between semantic similarity and the subcategorization frames of the verbs in English, is equally spread out from the 'very strongly related' to the 'very weakly related'. Some semantically similar verbs share a lot in terms of their subcategorization frames, and some others indicate an average degree of strength in the relationship, while the others, though still semantically similar, tend to share little in their subcategorization frames.

  • PDF

A Keyword Query Processing Technique of OWL Data using Semantic Relationships (의미적 관계를 이용한 OWL 데이터의 키워드 질의 처리 기법)

  • Kim, Youn Hee;Kim, Sung Wan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.1
    • /
    • pp.59-72
    • /
    • 2013
  • In this paper, we propose a keyword query processing technique based on semantic relationships for OWL data. The proposed keyword query processing technique can improve user's search satisfaction by performing two types of associative search. The first associative search uses information inferred by the relationships between classes or properties during keyword query processing. And it supports to search all information resources that are either directly or indirectly related with query keywords by semantic relationships between information resources. The second associative search returns not only information resources related with query keywords but also values of properties of them. We design a storage schema and index structures to support the proposed technique. And we propose evaluation functions to rank retrieved information resources according to three criteria. Finally, we evaluate the validity and accuracy of the proposed technique through experiments. The proposed technique can be utilized in a variety of fields, such as paper retrieval and multimedia retrieval.