arXiv subjects

Yuzhao Yang

Publications and source records attributed to Yuzhao Yang.

6 recordsLinked to original sources

arXiv2026

Belief Updating without Complete Trust

We represent a non-Bayesian agent as one who does not completely trust the information they receive. The behavioral expression of complete trust lies in a homogeneity property of Bayesian updating: posterior beliefs do not change if a signal is made arbitrarily rare by scaling down its likelihood vector. We show that simply dropping this property and retaining all other Bayesian behavioral properties yields a unique representation where the agent is still Bayesian but has subjective uncertainty over the information structure generating the signal. The representation result is proved using the Fundamental Theorem of Projective Geometry. We analyze how various updating biases may be rationalized by a lack of trust.

econ.TH↗

arXiv2024

(Non-)Commutative Aggregation

Commutativity is a normative criterion of aggregation and updating stating that the aggregation of expert posteriors should be identical to the update of the aggregated priors. I propose a thought experiment that raises questions about the normative appeal of Commutativity. I propose a weakened version of Commutativity and show how that assumption plays central roles in the characterization of linear belief aggregation, multiple-weight aggregation, and an aggregation rule which can be viewed as the outcome of a game played by "dual-selves," Pessimism and Optimism. Under suitable conditions, I establish equivalences between various relaxations of Commutativity and classic axioms for decision-making under uncertainty, including Independence, C-Independence, and Ambiguity Aversion.

econ.TH↗

arXiv2022

Dimensional Data KNN-Based Imputation

Data Warehouses (DWs) are core components of Business Intelligence (BI). Missing data in DWs have a great impact on data analyses. Therefore, missing data need to be completed. Unlike other existing data imputation methods mainly adapted for facts, we propose a new imputation method for dimensions. This method contains two steps: 1) a hierarchical imputation and 2) a k-nearest neighbors (KNN) based imputation. Our solution has the advantage of taking into account the DW structure and dependency constraints. Experimental assessments validate our method in terms of effectiveness and efficiency.

cs.DB↗

arXiv2021

Internal Data Imputation in Data Warehouse Dimensions

Missing values occur commonly in the multidimensional data warehouses. They may generate problems of usefulness of data since the analysis performed on a multidimensional data warehouse is through different dimensions with hierarchies where we can roll up or drill down to the different parameters of analysis. Therefore, it's essential to complete these missing values in order to carry out a better analysis. There are existing data imputation methods which are suitable for numeric data, so they can be applied for fact tables but not for dimension tables. Some other data imputation methods need extra time and effort costs. As consequence, we propose in this article an internal data imputation method for multidimensional data warehouse based on the existing data and considering the intra-dimension and inter-dimension relationships.

cs.DB↗

arXiv2021

An Automatic Schema-Instance Approach for Merging Multidimensional Data Warehouses

Using data warehouses to analyse multidimensional data is a significant task in company decision-making.The data warehouse merging process is composed of two steps: matching multidimensional components and then merging them. Current approaches do not take all the particularities of multidimensional data warehouses into account, e.g., only merging schemata, but not instances; or not exploiting hierarchies nor fact tables. Thus, in this paper, we propose an automatic merging approach for star schema-modeled data warehouses that works at both the schema and instance levels. We also provide algorithms for merging hierarchies, dimensions and facts. Eventually, we implement our merging algorithms and validate them with the use of both synthetic and benchmark datasets.

cs.DB↗

arXiv2020

Automatic Integration Issues of Tabular Data for On-Line Analysis Processing

Companies and individuals produce numerous tabular data. The objective of this position paper is to draw up the challenges posed by the automatic integration of data in the form of tables so that they can be cross-analyzed. We provide a first automatic solution for the integration of such tabular data to allow On-Line Analysis Processing. To fulfil this task, features of tabular data should be analyzed and the challenge of automatic multidimensional schema generation should be addressed. Hence, we propose a typology of tabular data and discuss our idea of an automatic solution.

cs.DB↗