• Title/Summary/Keyword: Preserving Information

Search Result 858, Processing Time 0.033 seconds

Update Semantic Preserving Object-Oriented View (갱신 의미 보존 객체-지향 뷰)

  • 나영국
    • The KIPS Transactions:PartD
    • /
    • v.8D no.1
    • /
    • pp.32-43
    • /
    • 2001
  • Due to the limitation of data modeling power and the view update ambiguity, relational view is limitedly used for engineering applications. On the contrary, object-oriented database view would playa vital role in defining custom interface for engineering applications because the above two limitations of the relational view are overcome by the object-oriented view. Above all, engineering application data interface should fully support updates. More specifically, updates against the data interface needs to be unambiguously defined and its semantic behavior should be equal to base schema updates'. For this purpose, we define the notion of update semantic preserving which means that view updates displays the same semantics as base schema. Besides, in order to show the feasibility of this characteristics, specific and concrete algorithms for update preserving updates are presented for a CAD specialized object-oriented database view - MultiView. This paper finds that in order that virtual classes coudld form a schema with 'isa' relationships rather than just a group of classes, the update semantics on the virtual classes should be defined such that the implied meaning of 'isa' relationships between classes are not to be violated. Besides, as its sufficiency conditions, we derived the update semantics and schema constituable conditions of the virtual classes that make view schemas look like base schemas. To my best knowledge, this is the first research that presents the sufficiency conditions by which we could defined object-oriented views as integrated schemas rather than as separate classes.

  • PDF

Age Estimation via Selecting Discriminated Features and Preserving Geometry

  • Tian, Qing;Sun, Heyang;Ma, Chuang;Cao, Meng;Chu, Yi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1721-1737
    • /
    • 2020
  • Human apparent age estimation has become a popular research topic and attracted great attention in recent years due to its wide applications, such as personal security and law enforcement. To achieve the goal of age estimation, a large number of methods have been pro-posed, where the models derived through the cumulative attribute coding achieve promised performance by preserving the neighbor-similarity of ages. However, these methods afore-mentioned ignore the geometric structure of extracted facial features. Indeed, the geometric structure of data greatly affects the accuracy of prediction. To this end, we propose an age estimation algorithm through joint feature selection and manifold learning paradigms, so-called Feature-selected and Geometry-preserved Least Square Regression (FGLSR). Based on this, our proposed method, compared with the others, not only preserves the geometry structures within facial representations, but also selects the discriminative features. Moreover, a deep learning extension based FGLSR is proposed later, namely Feature selected and Geometry preserved Neural Network (FGNN). Finally, related experiments are conducted on Morph2 and FG-Net datasets for FGLSR and on Morph2 datasets for FGNN. Experimental results testify our method achieve the best performances.

Privacy-Preserving Kth Element Score over Vertically Partitioned Data on Multi-Party (다자 간 환경에서 수직 분할된 데이터에서 프라이버시 보존 k번째 항목의 score 계산)

  • Hong, Jun Hee;Jung, Jay Yeol;Jeong, Ik Rae
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.6
    • /
    • pp.1079-1090
    • /
    • 2014
  • Data mining is a technique to get the useful information that can be utilized for marketing and pattern analysis by processing the data that we have. However, when we use this technique, data provider's personal data can be leaked by accident. To protect these data from leakage, there were several techniques have been studied to preserve privacy. Vertically partitioned data is a state called that the data is separately provided to various number of user. On these vertically partitioned data, there was some methods developed to distinguishing kth element and (k+1) th element by using score. However, in previous method, we can only use on two-party case, so in this paper, we propose the extended technique by using paillier cryptosystem which can use on multi-party case.

A Model for Privacy Preserving Publication of Social Network Data (소셜 네트워크 데이터의 프라이버시 보호 배포를 위한 모델)

  • Sung, Min-Kyung;Chung, Yon-Dohn
    • Journal of KIISE:Databases
    • /
    • v.37 no.4
    • /
    • pp.209-219
    • /
    • 2010
  • Online social network services that are rapidly growing recently store tremendous data and analyze them for many research areas. To enhance the effectiveness of information, companies or public institutions publish their data and utilize the published data for many purposes. However, a social network containing information of individuals may cause a privacy disclosure problem. Eliminating identifiers such as names is not effective for the privacy protection, since private information can be inferred through the structural information of a social network. In this paper, we consider a new complex attack type that uses both the content and structure information, and propose a model, $\ell$-degree diversity, for the privacy preserving publication of the social network data against such attacks. $\ell$-degree diversity is the first model for applying $\ell$-diversity to social network data publication and through the experiments it shows high data preservation rate.

Multi-variate Fuzzy Polynomial Regression using Shape Preserving Operations

  • Hong, Dug-Hun;Do, Hae-Young
    • Journal of the Korean Data and Information Science Society
    • /
    • v.14 no.1
    • /
    • pp.131-141
    • /
    • 2003
  • In this paper, we prove that multi-variate fuzzy polynomials are universal approximators for multi-variate fuzzy functions which are the extension principle of continuous real-valued function under $T_W-based$ fuzzy arithmetic operations for a distance measure that Buckley et al.(1999) used. We also consider a class of fuzzy polynomial regression model. A mixed non-linear programming approach is used to derive the satisfying solution.

  • PDF

Fuzzy c-Regression Using Weighted LS-SVM

  • Hwang, Chang-Ha
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.161-169
    • /
    • 2005
  • In this paper we propose a fuzzy c-regression model based on weighted least squares support vector machine(LS-SVM), which can be used to detect outliers in the switching regression model while preserving simultaneous yielding the estimates of outputs together with a fuzzy c-partitions of data. It can be applied to the nonlinear regression which does not have an explicit form of the regression function. We illustrate the new algorithm with examples which indicate how it can be used to detect outliers and fit the mixed data to the nonlinear regression models.

  • PDF

Color Image Compression by Moment-Preserving and Block Truncation Coding Techniques (순간포착에 의한 칼라 영상 압축과 블록 절단 코딩)

  • 박호식;차영석;최현수;권오홍;배철수;최철재;나상동
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.342-347
    • /
    • 2000
  • 새로운 칼라 영상 압축은 순간 포착과 블록절단 코딩에 기초로 두 개의 대표적인 칼라 중 하나로 할당된 각각의 블록 화소와 겹치지 않은 블록으로 분할된 입력은 블록에서 포착된 어떤 순간으로부터 유래된 해석방식으로 계산된다. 비트맵은 화소의 칼라를 묘사하기 위해 각각의 블록을 일반화하며 별개의 균일한 조건에 의해 설정된 대표적인 칼라는 동일하다고 간주되고 부호 비트를 저장하기 위해 이용된다. 본 연구에서 실험결과에 의해 13이상의 좋은 평균 압축률이 달성될 수 있었다.

  • PDF

TERNARY UNIVARIATE CURVATURE-PRESERVING SUBDIVISION

  • JEON MYUNGJIN;HAN DONGSOONG;PARK KYEONGSU;CHOI GUNDON
    • Journal of applied mathematics & informatics
    • /
    • v.18 no.1_2
    • /
    • pp.235-246
    • /
    • 2005
  • We present an interpolating, univariate subdivision scheme which preserves the discrete curvature and tangent direction at each step of subdivision. Since the polygon have a geometric information of some original(in some sense) curve as a discrete curvature, we can expect that the limit curve has the same curvature at each vertex as the control polygon. We estimate the curvature bound of odd vertices and give an error estimate for restoring a curve from sampled vertices on curves.

A Concurrency Preserving Patitioning Algorithm of DEVS Models : Using Structural Information of Models (병렬성을 고려한 DEVS 모델의 파티션 알고리즘: 모델의 구조 정보를 이용)

  • 김기형
    • Journal of the Korea Society for Simulation
    • /
    • v.6 no.1
    • /
    • pp.1-13
    • /
    • 1997
  • In this paper, we present a partitioning algorithm for distributed simulation of DEVS (Discrete Event System Specification) models. To preserve concurrency inherent in models, the proposed algorithm utilizes the structural information of models. Through benchmark simulation experiments, we show that the proposed algorithm can generate good partitions.

  • PDF