Abstract
Abstract A minimal spanning tree clustering algorithm is applied to gas chromatographic liquid phases. The tree is broken according to a rule which depends upon nearest neighbor information. The resulting minimal spanning tree divides the liquid phases into 13 clusters which vary in size from seven to 27 phases. Forty-one phases are designated as outliers in this analysis.
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.
