# A DISTRIBUTED ALGORITHM FOR FORMAL CONCEPTS PROCESSING BASED ON SEARCH SUBSPACES

### Nilander R. M. de Moraes, Luis E. Zárate, Henrique C. Freitas

#### Abstract

The processing of dense contexts is a common problem in Formal Concept Analysis. From input contexts, all possible combinations must be evaluated in order to obtain all correlations between objects and attributes. The state-of-the-art shows that this problem can be solved through distributed processing. Partial concepts would be obtained from a distributed environment composed of machine clusters in order to achieve the final set of concepts. Therefore, the goal of this paper is to propose, develop, and evaluate a distributed algorithm with high performance to solve the problem of dense contexts. The speedup achieved through the distributed algorithm shows an improvement of performance, but mainly, a high-balance workload which reduces the processing time considerably. For this reason, the main contribution of this paper is the distributed algorithm, capable of accelerating the processing for dense formal contexts.

#### References

- Carpineto, C. and Romano, G. (2004). Concept Data Analysis: Theory and Applications. John Wiley and Sons.
- Fu, H. and Nguifo, E. (2003). Partitioning large data to scale up lattice-based algorithm. Tools with Artificial Intelligence, 2003. Proceedings. 15th IEEE International Conference on, pages 537-541.
- Ganter, B. (2002). Formal concepts analisys: algorithmic aspects. TU Dresden, Germany, Tech. Report.
- Ganter, B. and Wille, R. (1997). Formal Concept Analysis: Mathematical Foundations. Springer-Verlag New York, Inc., Secaucus, NJ, USA. Translator-Franzke, C.
- Hu, X., Wei, X., Wang, D., and Ii, P. (2007). A parallel algorithm to construct concept lattice. Fuzzy Systems and Knowledge Discovery, 2007. FSKD 2007. Fourth International Conference on, 2:119-123.
- Qi, H., Liu, D., Hu, C., Lu, M., and Zhao, L. (2004). A parallel algorithm based on search space partition for generating concepts. IEEE, (1):241-248.
- Rimsa, A., Zárate, L. E., and Song, M. A. J. (2009). Handling large formal context using bdd - perspectives and limitations. In Proceedings of the 7th International Conference on Formal Concept Analysis (ICFCA 2009), volume 5548 of LNCS/LNAI, pages 194-206, Darmstadt, Germany. Springer-Verlag.
- yun Li, Liu, Z.-T., Shen, X.-J., Wu, Q., and Qiang, Y. (2003). Theoretical research on the distributed construction of concept lattices. In Machine Learning and Cybernetics, 2003 International Conference on, volume 1, pages 474-479 Vol.1.

#### Paper Citation

#### in Harvard Style

R. M. de Moraes N., E. Zárate L. and C. Freitas H. (2010). **A DISTRIBUTED ALGORITHM FOR FORMAL CONCEPTS PROCESSING BASED ON SEARCH SUBSPACES** . In *Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 1: ICEIS,* ISBN 978-989-8425-04-1, pages 105-111. DOI: 10.5220/0002976801050111

#### in Bibtex Style

@conference{iceis10,

author={Nilander R. M. de Moraes and Luis E. Zárate and Henrique C. Freitas},

title={A DISTRIBUTED ALGORITHM FOR FORMAL CONCEPTS PROCESSING BASED ON SEARCH SUBSPACES},

booktitle={Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},

year={2010},

pages={105-111},

publisher={SciTePress},

organization={INSTICC},

doi={10.5220/0002976801050111},

isbn={978-989-8425-04-1},

}

#### in EndNote Style

TY - CONF

JO - Proceedings of the 12th International Conference on Enterprise Information Systems - Volume 1: ICEIS,

TI - A DISTRIBUTED ALGORITHM FOR FORMAL CONCEPTS PROCESSING BASED ON SEARCH SUBSPACES

SN - 978-989-8425-04-1

AU - R. M. de Moraes N.

AU - E. Zárate L.

AU - C. Freitas H.

PY - 2010

SP - 105

EP - 111

DO - 10.5220/0002976801050111