Loading...
Please wait, while we are loading the content...
Similar Documents
An Incremental Algorithm for Computing n-concepts
| Content Provider | Semantic Scholar |
|---|---|
| Author | Tatiana, Makhalova Lhouari, Nourine |
| Copyright Year | 2017 |
| Abstract | In this paper a new incremental algorithm for computing nconcepts is proposed. The time complexity of the algorithm is O(|I| · In · |Bn|), where |I| is the size of a context (an n-ary relation), In = |K1||Bn−1| is the input, where K1 is a set corresponding to an added dimension and Bn−1 is the set of (n− 1)-concepts. The output Bn of the algorithm is a set of n-concepts. The algorithm creates n-concepts (i.e. elements in Bn) by merging sequentially (n−1)-concepts from Bn−1 with the corresponding elements from the n-th dimension (i.e. set K1). |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://ceur-ws.org/Vol-1921/paper5.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |