Sciweavers

496 search results - page 7 / 100
» Concept Lattices in Software Analysis
Sort
View
CLA
2007
13 years 8 months ago
Inducing Decision Trees via Concept Lattices
The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of cluster...
Radim Belohlávek, Bernard De Baets, Jan Out...
KBS
2006
127views more  KBS 2006»
13 years 7 months ago
Collaborative Recommending using Formal Concept Analysis
We show how Formal Concept Analysis (FCA) can be applied to Collaborative Recommenders. FCA is a mathematical method for analysing binary relations. Here we apply it to the relati...
Patrick du Boucher-Ryan, Derek G. Bridge
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
13 years 8 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
ICSE
2012
IEEE-ACM
11 years 9 months ago
Temporal analysis of API usage concepts
—Software reuse through Application Programming Interfaces (APIs) is an integral part of software development. The functionality offered by an API is not always accessed uniforml...
Gias Uddin, Barthélémy Dagenais, Mar...
MDAI
2007
Springer
14 years 1 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...