Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Visualizing data with formal concept analysis
Download
index.pdf
Date
2003
Author
Diner, Çağrı
Metadata
Show full item record
Item Usage Stats
68
views
0
downloads
Cite This
In this thesis, we wanted to stress the tendency to the geometry of data. This should be applicable in almost every branch of science, where data are of great importance, and also in every kind of industry, economy, medicine etc. Since machine's hard-disk capacities which is used for storing datas and the amount of data you can reach through internet is increasing day by day, there should be a need to turn this information into knowledge. This is one of the reasons for studying formal concept analysis. We wanted to point out how this application is related with algebra and logic. The beginning of the first chapter emphasis the relation between closure systems, galois connections, lattice theory as a mathematical structure and concept analysis. Then it describes the basic step in the formalization: An elementary form of the representation of data is defined mathematically. Second chapter explains the logic of formal concept analysis. It also shows how implications, which can be regard as special formulas on a set,between attributes can be shown by fewer implications, so called generating set for implications. These mathematical tools are then used in the last chapter, in order to describe complex 'concept' lattices by means of decomposition methods in examples.
Subject Keywords
Data analysis
,
Formal concept analysis
,
Lattice theory
,
Closure systems
,
Implications
,
Decompositions
URI
http://etd.lib.metu.edu.tr/upload/1046325/index.pdf
https://hdl.handle.net/11511/13593
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A marginalized multilevel model for bivariate longitudinal binary data
İnan, Gül; İlk Dağ, Özlem; Department of Statistics (2014)
This thesis study considers analysis of bivariate longitudinal binary data. We propose a model based on marginalized multilevel model framework. The proposed model consists of two levels such that the first level associates the marginal mean of responses with covariates through a logistic regression model and the second level includes subject/time specific random intercepts within a probit regression model. The covariance matrix of multiple correlated time-specific random intercepts for each subject is assu...
Modeling and implementation of local volatility surfaces in Bayesian framework
Animoku, Abdulwahab; Uğur, Ömür; Yolcu-Okur, Yeliz (2018-06-01)
In this study, we focus on the reconstruction of volatility surfaces via a Bayesian framework. Apart from classical methods, such as, parametric and non-parametric models, we study the Bayesian analysis of the (stochastically) parametrized volatility structure in Dupire local volatility model. We systematically develop and implement novel mathematical tools for handling the classical methods of constructing local volatility surfaces. The most critical limitation of the classical methods is obtaining negativ...
Nonautonomous Bifurcations in Nonlinear Impulsive Systems
Akhmet, Marat (Springer Science and Business Media LLC, 2020-01-01)
In this paper, we study existence of the bounded solutions and asymptotic behavior of an impulsive Bernoulli equations. Nonautonomous pitchfork and transcritical bifurcation scenarios are investigated. An examples with numerical simulations are given to illustrate our results.
Inverse Sturm-Liouville Systems over the whole Real Line
Altundağ, Hüseyin; Taşeli, Hasan; Department of Mathematics (2010)
In this thesis we present a numerical algorithm to solve the singular Inverse Sturm-Liouville problems with symmetric potential functions. The singularity, which comes from the unbounded domain of the problem, is treated by considering the limiting case of the associated problem on the symmetric finite interval. In contrast to regular problems which are considered on a finite interval the singular inverse problem has an ill-conditioned structure despite of the limiting treatment. We use the regularization t...
Interpreting a Graph and Constructing its Derivative Graph Stability and Change in Students Conceptions
Ubuz, Behiye (2007-06-01)
This present study investigated engineering students’ conceptions and misconceptions related to derivative, particularly interpreting the graph of a function and constructing its derivative graph. Participants were 147 first year engineering students from four universities enrolled in first year undergraduate calculus courses with or without the incorporation of computers for the purposes of seeing the power of visualization, investigating worked examples given in steps and solving various questions related...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ç. Diner, “Visualizing data with formal concept analysis,” M.S. - Master of Science, Middle East Technical University, 2003.