Name
Abstract | ||
|---|---|---|
We generalize the main notions of Formal Concept Analysis with the ideas of the semantic probabilistic inference. We demonstrate that under standard restrictions, our definitions completely correspond to the original notions of Formal Concept Analysis. From the point of view of applications, we propose a method of recovering concepts in formal contexts in presence of noise on data. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-29709-0_33 | Ershov Memorial Conference |
Keywords | Field | DocType |
semantic probabilistic inference,main notion,formal concept analysis,formal context,probabilistic concept,original notion,standard restriction | Probabilistic inference,Formal system,Computer science,Lattice Miner,Theoretical computer science,Probabilistic logic,Formal concept analysis | Conference |
Citations | PageRank | References |
2 | 0.40 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Demin | 1 | 5 | 0.82 |
| Denis Ponomaryov | 2 | 29 | 7.43 |
| Evgenii Vityaev | 3 | 37 | 8.41 |