• Title/Summary/Keyword: multidimensional data

Search Result 653, Processing Time 0.028 seconds

Service Level Evaluation Through Measurement Indicators for Public Open Data (공공데이터 개방 평가지표 개발을 통한 현황분석 및 가시화)

  • Kim, Ji-Hye;Cho, Sang-Woo;Lee, Kyung-hee;Cho, Wan-Sup
    • The Journal of Bigdata
    • /
    • v.1 no.1
    • /
    • pp.53-60
    • /
    • 2016
  • Data of central government and local government was collected automatically from the public data portal. And we did the multidimensional analysis based on various perspective like file format and present condition of public data. To complete this work, we constructed Data Warehouse based on the other countries' evaluation index case. Finally, the result from service level evaluation by using multidimensional analysis was used to display each area, establishment, fields.

  • PDF

Multidimensional Analysis of XML Documents using XML Cubes (XML 큐브를 이용한 다차원 XML 문서 분석)

  • Park, Byung-Kwon
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 2005.05a
    • /
    • pp.65-78
    • /
    • 2005
  • Nowadays, large amounts of XML documents are available on the Internet. Thus, we need to analyze them multi-dimensionally in the same way as relational data. In this paper, we propose a new frame-work for multidimensional analysis of XML documents, which we call XML-OLAP. We base XML-OLAP on XML warehouses where every fact data as well as dimension data are stored as XML documents. We build XML cubes from XML warehouses. We propose a new multidimensional expression language for XML cubes, which we call XML-MDX. XML-MDX statements target XML cubes and use XQuery expressions to designate the measure data. They specify text mining operators for aggregating text constituting the measure data. We evaluate XML-OLAP by applying it to a U.S. patent XML warehouse. We use XML-MDX queries, which demonstrate that XML-OLAP is effective for multi-dimensionally analyzing the U.S. patents.

  • PDF

DATA MINING-BASED MULTIDIMENSIONAL EXTRACTION METHOD FOR INDICATORS OF SOCIAL SECURITY SYSTEM FOR PEOPLE WITH DISABILITIES

  • BATYHA, RADWAN M.
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.1_2
    • /
    • pp.289-303
    • /
    • 2022
  • This article examines the multidimensional index extraction method of the disability social security system based on data mining. While creating the data warehouse of the social security system for the disabled, we need to know the elements of the social security indicators for the disabled. In this context, a clustering algorithm was used to extract the indicators of the social security system for the disabled by investigating the historical dimension of social security for the disabled. The simulation results show that the index extraction method has high coverage, sensitivity and reliability. In this paper, a multidimensional extraction method is introduced to extract the indicators of the social security system for the disabled based on data mining. The simulation experiments show that the method presented in this paper is more reliable, and the indicators of social security system for the disabled extracted are more effective in practical application.

Improving Interpretability of Multivariate Data Through Rotations of Artificial Variates

  • Hwang, S.Y.;Park, A.M.
    • Journal of the Korean Data and Information Science Society
    • /
    • v.15 no.2
    • /
    • pp.297-306
    • /
    • 2004
  • It is usual that multivariate data analysis produces related (small number of) artificial variates for data reduction. Among them, refer to MDS(multidimensional scaling), MDPREF(multidimensional preference analysis), CDA(canonical discriminant analysis), CCA(canonical correlation analysis) and FA(factor analysis). Varimax rotation of artificial variables which is originally invented in FA for easy interpretations is applied to diverse multivariate techniques mentioned above. Real data analysisis is performed in order to manifest that rotation improves interpretations of artificial variables.

  • PDF

Robust Multidimensional Scaling for Multi-robot Localization (멀티로봇 위치 인식을 위한 강화 다차원 척도법)

  • Je, Hong-Mo;Kim, Dai-Jin
    • The Journal of Korea Robotics Society
    • /
    • v.3 no.2
    • /
    • pp.117-122
    • /
    • 2008
  • This paper presents a multi-robot localization based on multidimensional scaling (MDS) in spite of the existence of incomplete and noisy data. While the traditional algorithms for MDS work on the full-rank distance matrix, there might be many missing data in the real world due to occlusions. Moreover, it has no considerations to dealing with the uncertainty due to noisy observations. We propose a robust MDS to handle both the incomplete and noisy data, which is applied to solve the multi-robot localization problem. To deal with the incomplete data, we use the Nystr$\ddot{o}$m approximation which approximates the full distance matrix. To deal with the uncertainty, we formulate a Bayesian framework for MDS which finds the posterior of coordinates of objects by means of statistical inference. We not only verify the performance of MDS-based multi-robot localization by computer simulations, but also implement a real world localization of multi-robot team. Using extensive empirical results, we show that the accuracy of the proposed method is almost similar to that of Monte Carlo Localization(MCL).

  • PDF

Mining Association Rules in Multidimensional Stream Data (다차원 스트림 데이터의 연관 규칙 탐사 기법)

  • Kim, Dae-In;Park, Joon;Kim, Hong-Ki;Hwang, Bu-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.13D no.6 s.109
    • /
    • pp.765-774
    • /
    • 2006
  • An association rule discovery, a technique to analyze the stored data in databases to discover potential information, has been a popular topic in stream data system. Most of the previous researches are concerned to single stream data. However, this approach may ignore in mining to multidimensional stream data. In this paper, we study the techniques discovering the association rules to multidimensional stream data. And we propose a AR-MS method reflecting the characteristics of stream data since make the summarization information by one data scan and discovering the association rules for significant rare data that appear infrequently in the database but are highly associated with specific event. Also, AR-MS method can discover the maximal frequent item of multidimensional stream data by using the summarization information. Through analysis and experiments, we show that AR-MS method is superior to other previous methods.

Dense Sub-Cube Extraction Algorithm for a Multidimensional Large Sparse Data Cube (다차원 대용량 저밀도 데이타 큐브에 대한 고밀도 서브 큐브 추출 알고리즘)

  • Lee Seok-Lyong;Chun Seok-Ju;Chung Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.33 no.4
    • /
    • pp.353-362
    • /
    • 2006
  • A data warehouse is a data repository that enables users to store large volume of data and to analyze it effectively. In this research, we investigate an algorithm to establish a multidimensional data cube which is a powerful analysis tool for the contents of data warehouses and databases. There exists an inevitable retrieval overhead in a multidimensional data cube due to the sparsity of the cube. In this paper, we propose a dense sub-cube extraction algorithm that identifies dense regions from a large sparse data cube and constructs the sub-cubes based on the dense regions found. It reduces the retrieval overhead remarkably by retrieving those small dense sub-cubes instead of scanning a large sparse cube. The algorithm utilizes the bitmap and histogram based techniques to extract dense sub-cubes from the data cube, and its effectiveness is demonstrated via an experiment.

A Data dependency Elimination method in multidimensional Subscript Loop Using a variable (다중첨자루프에서 변수를 이용한 종속성 제거 기법)

  • 박상일;박현호;김형욱;윤성대
    • Proceedings of the IEEK Conference
    • /
    • 2000.06c
    • /
    • pp.35-38
    • /
    • 2000
  • In this paper, we propose a new method to parallelize multidimensional subscript loop with non-uniform distance. A loop comprise most of the computation in a program and the most important source of parallelism. Multidimensional subscript within a loop difficult to determine for distance to be required loop dependence Elimination. Therefore we Propose new methods that is three algorithm to search subscript.

  • PDF

UNDERSTANDING SERVICE QUALITY: A MULTIDIMENSIONAL SCALING APPROACH

  • Lee, Dong-Won;Kim, Youn-Sung
    • Journal of Korean Society for Quality Management
    • /
    • v.32 no.3
    • /
    • pp.68-80
    • /
    • 2004
  • This paper purports to uncover the underlying attributes used by customers to gauge service quality. Data was collected by administering questionnaires to 50 respondents and then analyzed by using Multidimensional Scaling methodology. The findings indicate that there are two primary dimensions to service quality. This analysis helped determine us two alternatives to naming the dimensions. Experience properties of service and Price value of the service, or Responsiveness of service provider employees and Reliability of service providers.

UNDERSTANDING SERVICE QUALITY: A MULTIDIMENSIONAL SCALING APPROACH

  • Lee Dongwon;Kim Youn Sung
    • Proceedings of the Korean Society for Quality Management Conference
    • /
    • 2004.04a
    • /
    • pp.639-645
    • /
    • 2004
  • This paper purports to uncover the underlying attributes used by customers to gauge service quality. Data was collected by administering questionnaires to 50 respondents and then analyzed by using Multidimensional Scaling methodology. The findings indicate that there are two primary dimensions to service quality. A considerable analysis helped determine two alternatives to naming the dimensions: Experience properties of service and Price value of the service, or Responsiveness of service provider employees and Reliability of service providers.

  • PDF