• 전기학회논문지
• /
• 제58권3호
• /
• pp.632-638
• /
• 2009

Probabilistic Latent Semantic Analysis has many applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. In this paper, we propose an algorithm using weighted Probabilistic Latent Semantic Analysis Model to find the contextual phrases and opinions from documents. The traditional keyword search is unable to find the semantic relations of phrases, Overcoming these obstacles requires the development of techniques for automatically classifying semantic relations of phrases. Through experiments, we show that the proposed algorithm works well to discover semantic relations of phrases and presents the semantic relations of phrases to the vector-space model. The proposed algorithm is able to perform a variety of analyses, including such as document classification, online reputation, and collaborative recommendation.

• 한국감성과학회:학술대회논문집
• /
• 한국감성과학회 2008년도 추계학술대회
• /
• pp.90-93
• /
• 2008

In natural language, it is common that repetitive constituents in an expression are to be left out and it is necessary to figure out the constituents omitted at analyzing the meaning of the sentence. This paper is on recognition of boundaries of parallel noun phrases by figuring out constituents omitted. Recognition of parallel noun phrases can greatly reduce complexity at the phase of sentence parsing. Moreover, in natural language information retrieval, recognition of noun with modifiers can play an important role in making indexes. We propose an unsupervised probabilistic model that identifies parallel cores as well as boundaries of parallel noun phrases conjoined by a conjunctive particle. It is based on the idea of swapping constituents, utilizing symmetry (two or more identical constituents are repeated) and reversibility (the order of constituents is changeable) in parallel structure. Semantic features of the modifiers around parallel noun phrase, are also used the probabilistic swapping model. The model is language-independent and in this paper presented on parallel noun phrases in Korean language. Experiment shows that our probabilistic model outperforms symmetry-based model and supervised machine learning based approaches.

• 대한인간공학회지
• /
• 제25권4호
• /
• pp.41-49
• /
• 2006

In a decision making process, the ambiguity of qualitative probabilistic expressions may result in a wrong conclusion. For this reason there had been many studies of quantifying qualitative probabilistic expressions in English-speaking countries. In this research, quantification of Korean qualitative probabilistic expressions is conducted through 4-step questionnaires. The numerical data of 78 verbal phrases were collected in the first questionnaire and classified in two categories (i.e., uncertainty and frequency). In each category, qualitative probabilistic expressions were divided into eleven groups according to the similarity of the numerical values. In the second questionnaire, subjects selected a representative expression for each group, which totaled 11. In the third questionnaire each subject was asked to rank eleven expressions from 1 to 11 with 1 indicating the highest probability. At last, subjects conducted pairwise comparisons to obtain relative weights, which are used to convert into the numerical probability scale.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제35권2호
• /
• pp.128-136
• /
• 2008

한국어 구문 분석의 초기 단계로서 병렬구조의 해석은 파싱의 효율을 높일 수 있다. 본 논문은 병렬구조 해석을 위한 비지도식 언어에 독립적인 확률 모델을 제안한다. 이 모델은 병렬구조의 대칭성과 상호교환성에 근거한다. 대칭성은 같은 구조가 반복된다는 것이고, 교환성은 좌우 구성요소를 교환해도 같은 의미를 지닌다는 것이다. 병렬구조는 일반적으로 대칭성을 따르지만, 수식어의 성질에 따라서 한쪽만을 수식하는 비대칭적인 구조가 출현하기도 한다. 비대칭 병렬구조 해석을 위해서 추가적으로 수식관계 통계정보를 사용한다. 제안된 모델을 본 논문에서는 "와/과" 조사로 이루어진 한국어의 명사구 병렬구조를 해석하는데 사용되는 것[1]을 중점으로 보여준다. 지도적 방식에 의한 모델을 포함한 다른 모델들에 비해 효율적임을 실험적으로 보여준다.