Abstract
In data analyzing, data is often presented as sequences. To partition the data sequences, we propose a sequence clustering system in which a fuzzy compatible relation is employed to show the similarity between any two sequences. Moreover, the max–min transitive closure is applied to transfer the fuzzy compatible relation into a fuzzy equivalence relation. It is found that the data sequences with more similar variations are clustered together by using the proposed clustering system. In that case, the sequences are partitioned easily and quickly into clusters.
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.
