• 제목/요약/키워드: Merging attributes

검색결과 14건 처리시간 0.019초

속성 병합에 의한 컨조인트 분석 (Conjoint analysis by merging attributes)

  • 임용빈;박가희;정종희
    • 품질경영학회지
    • /
    • 제45권1호
    • /
    • pp.55-64
    • /
    • 2017
  • 본 연구는 컨조인트 분석에서 고려하고자 하는 속성의 수가 많은 경우 속성들의 병합을 통해 문항 당 묻는 속성의 수를 줄이는 방법을 제안한다. 속성 병합에 의한 문항 설계의 경우에 각 문항에 대한 응답자의 더욱 일관된 응답을 기대할 수 있어서 응답의 정확도를 높일 수 있다는 점에서 제안된 방법의 의의를 찾을 수 있다. 사례분석으로 2수준과 3수준 속성이 각각 4개인 $2^4{\times}3^4$ 문항 설계를 위하여 제안된 속성 병합 설계를 이용하여 블록의 크기가 36인 블록화 $6^4$ 설계를 생성하고, 각각의 문항에 대한 응답자들의 선호도 점수를 시뮬레이션 모형에 의해 생성하기 위해 주효과 A, C, V, W와 이인자 교호작용효과 AV, AW를 이용한 효용함수를 가정한다. 축차적인 변수 선택법과 모형 선택 기준에 따라서 1000회 반복된 시뮬레이션 모형에 의해 생성된 문항 자료를 분석하여 각 방법의 power를 비교한 결과, 보수적으로 변수를 선택하는 방법인 BIC를 기준으로 한 변수선택법과 유의수준을 0.01로 하는 본페로니 보정된 유의 수준값을 사용한 전진적 선택법이 적절한 모형 선택 방법으로 추천된다. 속성 병합 설계를 사용하는 경우에는 병합된 속성들 간의 교호작용효과를 추정할 수 없게 된다는 단점이 있다. 특정한 속성들 간의 교호작용효과가 존재할 가능성이 높다고 알려진 경우에는 실무 담당자들이 속성 병합 설계시에 병합되는 속성들의 배치를 조절해 잠재적인 속성들의 이인자 교호작용효과들은 추정가능하게 함으로써 이 문제는 해결 할 수 있다.

집합 값을 갖는 애트리뷰트에 대한 수직적으로 분할된 블록 중첩 루프 조인 (Vertically Partitioned Block Nested Loop join on Set-Valued Attributes)

  • 황환규
    • 산업기술연구
    • /
    • 제28권B호
    • /
    • pp.209-214
    • /
    • 2008
  • Set-valued attributes appear in many applications to model complex objects occurring in the real world. One of the most important operations on set-valued attributes is the set join, because it provides a various method to express complex queries. Currently proposed set join algorithms are based on block nested loop join in which inverted files are partitioned horizontally into blocks. Evaluating these joins are expensive because they generate intermediate partial results severely and finally obtain the final results after merging partial results. In this paper, we present an efficient processing of set join algorithm. We propose a new set join algorithm that vertically partitions inverted files into blocks, where each block fits in memory, and performs block nested loop join without producing intermediate results. Our experiments show that the vertical bitmap nested set join algorithm outperforms previously proposed set join algorithms.

  • PDF

Appearance-Order-Based Schema Matching

  • Ding, Guohui;Cao, Keyan;Wang, Guoren;Han, Dong
    • Journal of Computing Science and Engineering
    • /
    • 제8권2호
    • /
    • pp.94-106
    • /
    • 2014
  • Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.

Enhanced Locality Sensitive Clustering in High Dimensional Space

  • Chen, Gang;Gao, Hao-Lin;Li, Bi-Cheng;Hu, Guo-En
    • Transactions on Electrical and Electronic Materials
    • /
    • 제15권3호
    • /
    • pp.125-129
    • /
    • 2014
  • A dataset can be clustered by merging the bucket indices that come from the random projection of locality sensitive hashing functions. It should be noted that for this to work the merging interval must be calculated first. To improve the feasibility of large scale data clustering in high dimensional space we propose an enhanced Locality Sensitive Hashing Clustering Method. Firstly, multiple hashing functions are generated. Secondly, data points are projected to bucket indices. Thirdly, bucket indices are clustered to get class labels. Experimental results showed that on synthetic datasets this method achieves high accuracy at much improved cluster speeds. These attributes make it well suited to clustering data in high dimensional space.

데이터 마이닝을 위한 이산화 알고리즘에 대한 비교 연구 (A Comparative Study on Discretization Algorithms for Data Mining)

  • 최병수;김현지;차운옥
    • Communications for Statistical Applications and Methods
    • /
    • 제18권1호
    • /
    • pp.89-102
    • /
    • 2011
  • 이산화는 데이터 마이닝을 위한 전처리 과정으로서 연속형 변수를 이산형 변수로 바꾸는 과정이고, 이산화 시킨 데이터가 원래 가지고 있던 정보손실을 최소로 하면서 높은 분류정확도를 가지는 것을 목적으로 한다. 지금까지 많은 이산화 알고리즘이 제안되었는데, 본 논문에서는 분할 이산화와 병합 이산화의 관점에서 최근까지 제안된 대표적인 이산화 알고리즘들을 비교하고, 이산화 알고리즘이 가지고 있는 특성을 연구하였다. 또한 비교 연구한 이산화 알고리즘을 R코드로 작성하여 다른 연구에 사용할 수 있도록 하였다.

해외기업 인수합병 시 정보시스템 통합 방법론에 관한 사례연구 (A Case Study of Post-Merger IT Integration Methodology on Cross-Border Mergers and Acquisitions)

  • 서병완;백승익
    • 한국IT서비스학회지
    • /
    • 제10권4호
    • /
    • pp.67-81
    • /
    • 2011
  • Recently, Mergers and Acquisitions (M&A) have become increasingly popular in the last few decades, and overseas' M&A are particularly increasing to sharpen corporate competitiveness on a global scale. Previous studies showed that one of the main reasons attributes to failures of mergers was the lack of attention to merging information systems. In recent years, both academy and industry have more focused on Post-Merger Integration (PMI) and the integration of information systems (IS) between two companies is one of the critical success factors of corporate. This paper focused on Post-Merger IT (Information Technology) Integration Methodology of Cross-Border M&A. We followed a single-site qualitative case study method in order to investigate the type of phenomenon in M&A's natural setting. Moreover, we examined a typical energy and power company case in order-based industry, so that other industry players may have different results to determine post-merger IT integration method and scope.

Computing Semantic Similarity between ECG-Information Concepts Based on an Entropy-Weighted Concept Lattice

  • Wang, Kai;Yang, Shu
    • Journal of Information Processing Systems
    • /
    • 제16권1호
    • /
    • pp.184-200
    • /
    • 2020
  • Similarity searching is a basic issue in information processing because of the large size of formal contexts and their complicated derivation operators. Recently, some researchers have focused on knowledge reduction methods by using granular computing. In this process, suitable information granules are vital to characterizing the quantities of attributes and objects. To address this problem, a novel approach to obtain an entropy-weighted concept lattice with inclusion degree and similarity distance (ECLisd) has been proposed. The approach aims to compute the combined weights by merging the inclusion degree and entropy degree between two concepts. In addition, another method is utilized to measure the hierarchical distance by considering the different degrees of importance of each attribute. Finally, the rationality of the ECLisd is validated via a comparative analysis.

낙인(stigma) 개념분석 (Concept Analysis of Stigma)

  • 이인옥;이은옥
    • 근관절건강학회지
    • /
    • 제13권1호
    • /
    • pp.53-66
    • /
    • 2006
  • Aims. In order to analyze the concept of stigma, so to develop a valid instrument to measure stigma. Methods. First, a concept analysis was conducted with the aim of clarifying the state of the science of discipline-specific conceptualizations of stigma. The criterion-based method of concept analysis as described by Morse and colleagues was used (Morse et al., 1996; Morse, 2000). This analytic process enabled the assessment of the scientific maturity of the concept of stigma. The interdisciplinary concept of stigma was found to be immature. Based on this level of maturity it was determined that in order to advance the concept of stigma toward gloater maturity. techniques of concept development using the literature as data were applied. In this process, questions were 'asked of the data' (in this case, the selected disciplinary literatures) to identify the conceptual components of stigma. Results. The inquiry into the concept of stigma led to the development of an expanded interdisciplinary conceptual definition by merging the most coherent commonalties from each discipline. And the conceptual components of stigma were identified. The antecedent factors of stigma were "apart from social identity". The attributes of stigma were "devaluing, labeling, negative stereotypes, discrimination". The consequences of stigma were "social rejection, social isolation, deficiency of social support, low social status".

  • PDF

The Generation of Digital Orthophotos and Three Dimensional Models of an Urban Area from Digital Aerial Photos

  • Lee, Jin-Duk
    • Korean Journal of Geomatics
    • /
    • 제2권2호
    • /
    • pp.131-137
    • /
    • 2002
  • The digital photogrammetric products have been increasingly used as an accurate foundation for representing information associated with infrastructure management. The technological advances in merging raster and vector data within the framework of GIS have allowed for the inclusion of DTMs and digital orthophotos with vector data and its associated attributes. This study addresses not only generating DEMs and digital orthophotos but producing three dimensional building models from aerial photos of an urban area by employing the digital photogrammetric technology. DEMs and digital orthophotos were automatically generated through the process of orientations, image matching and so on, and then the practical problems, which must be solved especially in applying to urban areas, were considered. The accuracy of produced digital orthophotos was derived by using check points. Also three dimensional visualization imagery, which is useful in the landform analysis, and 3D building models were produced. Digital photogrammetric products would be used widely not only as GIS framework data layers by using the GIS link function which links attribute and image information in the database for applying to infrastructure management and but as geospatial data for especially 3D GIS in urban areas.

  • PDF

행위와 속성 분석을 통한 TV 의 3D 그래픽 인터페이스 디자인 연구 -실생활과 접목된 필연적인 인터페이스 구현을 위한 방법론 (3D Graphic Interface Design for TV using Behavior and Attribute Analysis)

  • 심재희;김운영;김지해;이형남;장세훈
    • 한국HCI학회:학술대회논문집
    • /
    • 한국HCI학회 2009년도 학술대회
    • /
    • pp.996-1000
    • /
    • 2009
  • TV 인터페이스에 3D 그래픽을 적용하는 목적은 크게 세 가지로 구분할 수 있다. 첫째, 필연적인 사용성이다. 3D 공간은 기존의 심미적 혹은 기술 과시적 목적에서 벗어나 제품과 사용자간의 인터랙션을 가장 필연적으로 대변할 수 있는 방법이다. 둘째, 실생활과의 접목을 통해 사용자의 감성 만족도를 극대화하는 측면이다. 아날로그로의 회귀 혹은 디지로그라는 트렌드를 넘어 실생활의 물체들을 사용하듯이 자연스러운 사용자 인터페이스를 구현하기 위해 3D 를 선택하였다. 실생활처럼 자연스러운 인터페이스를 위하여 우리는 사용자가 평상시 물건들을 어떻게 사용하는지의 행위를 분석하고 그 행위 이면에 숨어있는 속성들을 파악하였다. 셋째, 통합화된 TV에서의 방대한 컨텐츠를 담을 수 있는 확장성 측면이다. 한정된 화면 안에 방대한 컨텐츠를 효과적으로 담을 수 있는 방법은 3D 가 최적이라고 생각한다. 3D 그래픽에서만 나타나는 공간의 개념은 2D 그래픽과 차별화되는 가장 대표적인 요소이며 이는 무한의 확장성을 제공한다. 이와 같이 TV 인터페이스에 3D 그래픽을 활용하는 것은 큰 의미가 있으며 실제 제품에 최적화해 가는 과정에서 그 효과를 얼마나 유지할 수 있는냐에 대한 문제가 가장 중요한 이슈가 될 것이다.

  • PDF