On formal concept analysis (fca)

  • Thread starter Thread starter vandanak
  • Start date Start date
  • Tags Tags
    Analysis Concept
vandanak
Messages
34
Reaction score
0
Hi,
I was using Hasse Diagram as it is great tool for data analysis but there is a confusion the thing is that I downloaded a software for fca and every time it uses a algorithm it gives a different lattice ,I do understand but suppose I am using it for some representation of concept lattice the lattice has been made between extents and intents then how do I interpret the hidden knowledge from the diagram for further analysis any help would be appreciated.
Thanks in advance
 
Thanks for reply. I was thinking and I went through some research papers which were from land use policy and medical sciences and also from a conference book so I came to the conclusion that basically if I use the diagram then what I interpret from the diagram it depends on the expertise of my field in that area .as such it does not have any theorems I suppose which can be used to draw conclusions in other fields or I suppose I do not have that expertise to draw conclusion for other subjects.If I am not wrong this is a less researched area. Yes there are software for FCA online.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
144
Views
10K
Replies
7
Views
3K
Replies
3
Views
2K
Replies
4
Views
2K
Replies
12
Views
2K
Replies
1
Views
1K
Replies
2
Views
2K
Back
Top