Abstract
In this paper we propose several possible modifications to the OAC-triclustering algorithms based on the prime operators. This method based on the framework of Formal Concept Analysis showed some rather promising results in the previous research. But while it is fast and efficient with respect to such measures as average density of the output, diversity, coverage, and noise- tolerance, it produces rather large number of triclusters. This makes it almost impossible for the expert to manually check the results. We show that the proposed post-processing techniques not only reduce the size of the output for this approach and keep the good values for the measures, but also keep the time complexity of the original algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
