• Title/Summary/Keyword: Merging attributes

Search Result 14, Processing Time 0.021 seconds

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

  • Lim, Yong B.;Park, Gahee;Chung, Jong Hee
    • Journal of Korean Society for Quality Management
    • /
    • v.45 no.1
    • /
    • pp.55-64
    • /
    • 2017
  • Purpose: A large number of attributes with mixed levels are often considered in the conjoint analysis. The respondents may have difficulty with scoring their preferences accurately because of many attribute items involved in each survey question. We research on the technique for reducing the number of attribute items. Methods: In order to reduce the number of attribute items in a survey question, we make a new attribute by merging two original attributes. A 'No question' option is also included as a new level in a merged attribute. Results: We propose BIB $6^4$ design in the case where we have four attributes with 2 levels and 3 levels, respectively and then analyze all the respondents survey data generated by the repeated simulation study in order to compare various model selection methods. Conclusion: How to reduce the number of attribute items is proposed and how to design and analyze the survey data are illustrated.

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

  • Whang, Whan-Kyu
    • Journal of Industrial Technology
    • /
    • v.28 no.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
    • /
    • v.8 no.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
    • /
    • v.15 no.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 (데이터 마이닝을 위한 이산화 알고리즘에 대한 비교 연구)

  • Choi, Byong-Su;Kim, Hyun-Ji;Cha, Woon-Ock
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.1
    • /
    • pp.89-102
    • /
    • 2011
  • The discretization process that converts continuous attributes into discrete ones is a preprocessing step in data mining such as classification. Some classification algorithms can handle only discrete attributes. The purpose of discretization is to obtain discretized data without losing the information for the original data and to obtain a high predictive accuracy when discretized data are used in classification. Many discretization algorithms have been developed. This paper presents the results of our comparative study on recently proposed representative discretization algorithms from the view point of splitting versus merging and supervised versus unsupervised. We implemented R codes for discretization algorithms and made them available for public users.

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

  • Suh, Byung-Wan;Baek, Seung-Ik
    • Journal of Information Technology Services
    • /
    • v.10 no.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
    • /
    • v.16 no.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.

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

  • Lee, In-Ok;Lee, Eun-Ok
    • Journal of muscle and joint health
    • /
    • v.13 no.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
    • /
    • v.2 no.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

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

  • Shim, Jae-Hee;Kim, Uni-Young;Kim, Ji-Hea;Lee, Hyung-Nam;Jang, Sae-Hun
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.996-1000
    • /
    • 2009
  • There can be three objectives why we apply 3D graphics in TV interface. First, inevitable usability. 3D space is the most inevitable way for product-user interaction deviating from the current aesthetic or technical purpose of use. Second, enhance emotional satisfaction by merging interface into real life. Beyond digilog(analog+digital), we wanted users to naturally use the interface as if they are using everyday objects. And in order to do this properly, we analyzed the behaviors of users how they use their everyday objects and then analyzed the attributes beyond each behavior. Third, capaticy for enourmous contents of the incorporated TV. The most efficient way to display enormous amounts of contents in a limited screen is 3D. And that 3D space gives us almost unlimited capacity in accepting contents. Now to conclude, using 3D graphics for TV interface has significance in many ways but the issue is how we can maintain the 3D effects while customizing them into real products.

  • PDF