6 research outputs found
Generalized Additive Model Implementation for Germany Real Estate Market - Model, API, UI Development
No full textInternship Report presented as the partial requirement for obtaining a Master's degree in Data Science and Advanced AnalyticsHedonic pricing approach one of the most accepted methodologies for the real estate price
assessment by delivering attribute-based value. It emerges from the value changing regarding object
attributes conditions. In real estate market, these changes can be property renovation, material, and
construction depreciation, or even expanding the plot area.
The scope of the internship report is to be explained the development first prototype General Additive
Model of predicting House square meter price basis on Hedonic pricing theory for a certain region of
Germany.
In addition to the model development, bringing it into live via Rest API and User Interface is explained
in this report.
Data Science Service GMBH is the owner of the project and specialized in real estate property appraisal
that is derived from statistical learning models, currently only at Austria. The outcome of this project
enables us to get into Germany Real Estate Market as well.
The necessary data has been brought by German Market Partner, Forschung und Beratung für
Wohnen, Immobilien und Umwelt GmbH (F+B), however Data Science Service GMBH (DSS) is
responsible for delivering the model product from beginning to end.
R Programming Drake package is used for parallel computation and to be generated maintainable
adaptive data pipeline. Parameter selection based on information criteria has been done for each
model in every kind of real estate property.
Lastly, the statistical model is delivered by rest API to UI (Shiny Application), both are developed with
R programming language
ISTA Thesis
No full textThe first part of the thesis considers the computational aspects of the homotopy groups πd(X) of a topological space X. It is well known that there is no algorithm to decide whether the fundamental group π1(X) of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with π1(X) trivial), compute the higher homotopy group πd(X) for any given d ≥ 2.
However, these algorithms come with a caveat: They compute the isomorphism type of πd(X), d ≥ 2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of πd(X). We present an algorithm that, given a simply connected space X, computes πd(X) and represents its elements as simplicial maps from suitable triangulations of the d-sphere Sd to X. For fixed d, the algorithm runs in time exponential in size(X), the number of simplices of X. Moreover, we prove that this is optimal: For every fixed d ≥ 2,
we construct a family of simply connected spaces X such that for any simplicial map representing a generator of πd(X), the size of the triangulation of S d on which the map is defined, is exponential in size(X).
In the second part of the thesis, we prove that the following question is algorithmically undecidable for d < ⌊3(k+1)/2⌋, k ≥ 5 and (k, d) ̸= (5, 7), which covers essentially everything outside the meta-stable range: Given a finite simplicial complex K of dimension k, decide whether there exists a piecewise-linear (i.e., linear on an arbitrarily fine subdivision of K) embedding f : K ↪→ Rd of K into a d-dimensional Euclidean space
Embeddability of Simplicial Complexes is Undecidable
No full textWe consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd?
The special case EMBED1→2 is graph planarity, which is decidable in linear time, as shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are known to be decidable (as well as NP-hard), and recent results of Čadek et al. in computational homotopy theory, in combination with the classical Haefliger–Weber theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial time for any fixed pair (k, d) of dimensions in the so-called metastable range .
Here, by contrast, we prove that EMBEDk→d is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for . This almost completely resolves the decidability vs. undecidability of EMBEDk→d in higher dimensions and establishes a sharp dichotomy between polynomial-time solvability and undecidability.
Our result complements (and in a wide range of dimensions strengthens) earlier results of Matoušek, Tancer, and the second author, who showed that EMBEDk→d is undecidable for 4 ≤ k ϵ {d – 1, d}, and NP-hard for all remaining pairs (k, d) outside the metastable range and satisfying d ≥ 4
Computing simplicial representatives of homotopy group elements
No full textA central problem of algebraic topology is to understand the homotopy groups () of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group 1() of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with 1() trivial), compute the higher homotopy group () for any given ≥2 . However, these algorithms come with a caveat: They compute the isomorphism type of () , ≥2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of () . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes () and represents its elements as simplicial maps from a suitable triangulation of the d-sphere to X. For fixed d, the algorithm runs in time exponential in size() , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed ≥2 , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of () , the size of the triangulation of on which the map is defined, is exponential in size()
Candidate SNP markers of reproductive potential are predicted by a significant change in the affinity of TATA-binding protein for human gene promoters
No full textBackground: The progress of medicine, science, technology, education, and culture improves, year by year, quality of life and life expectancy of the populace. The modern human has a chance to further improve the quality and duration of his/her life and the lives of his/her loved ones by bringing their lifestyle in line with their sequenced individual genomes. With this in mind, one of genome-based developments at the junction of personalized medicine and bioinformatics will be considered in this work, where we used two Web services: (i) SNP_TATA_Comparator to search for alleles with a single nucleotide polymorphism (SNP) that alters the affinity of TATA-binding protein (TBP) for the TATA boxes of human gene promoters and (ii) PubMed to look for retrospective clinical reviews on changes in physiological indicators of reproductive potential in carriers of these alleles. Results: A total of 126 SNP markers of female reproductive potential, capable of altering the affinity of TBP for gene promoters, were found using the two above-mentioned Web services. For example, 10 candidate SNP markers of thrombosis (e.g., rs563763767) can cause overproduction of coagulation inducers. In pregnant women, Hughes syndrome provokes thrombosis with a fatal outcome although this syndrome can be diagnosed and eliminated even at the earliest stages of its development. Thus, in women carrying any of the above SNPs, preventive treatment of this syndrome before a planned pregnancy can reduce the risk of death. Similarly, seven SNP markers predicted here (e.g., rs774688955) can elevate the risk of myocardial infarction. In line with Bowles' lifespan theory, women carrying any of these SNPs may modify their lifestyle to improve their longevity if they can take under advisement that risks of myocardial infarction increase with age of the mother, total number of pregnancies, in multiple pregnancies, pregnancies under the age of 20, hypertension, preeclampsia, menstrual cycle irregularity, and in women smokers. Conclusions: According to Bowles' lifespan theory-which links reproductive potential, quality of life, and life expectancy-the above information was compiled for those who would like to reduce risks of diseases corresponding to alleles in own sequenced genomes. Candidate SNP markers can focus the clinical analysis of unannotated SNPs, after which they may become useful for people who would like to bring their lifestyle in line with their sequenced individual genomes. © 2018 The Author(s)
