Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Formal concept analysis
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Method of deriving an ontology}} {{Expand German|Formale Begriffsanalyse|date=February 2012}} In [[information science]], '''formal concept analysis''' ('''FCA''') is a [[Principle|principled way]] of deriving a ''concept hierarchy'' or formal [[Ontology (computer science)|ontology]] from a collection of [[Mathematical object|objects]] and their [[Property (philosophy)|properties]]. Each concept in the hierarchy represents the objects sharing some set of properties; and each sub-concept in the hierarchy represents a [[subset]] of the objects (as well as a superset of the properties) in the concepts above it. The term was introduced by [[Rudolf Wille]] in 1981, and builds on the mathematical theory of [[lattice theory|lattices]] and [[order theory|ordered sets]] that was developed by [[Garrett Birkhoff]] and others in the 1930s. Formal concept analysis finds practical application in fields including [[data mining]], [[text mining]], [[machine learning]], [[knowledge management]], [[semantic web]], [[software development]], [[chemistry]] and [[biology]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)