Sparse min-max k-means algorithm for high-dimensional data clustering

Simple item page
dc.contributor.authorDey, Sayak
dc.date.accessioned2018-08-03T05:55:06Z
dc.date.available2018-08-03T05:55:06Z
dc.date.issued2018
dc.descriptionDissertation under the supervision of Dr. Swagatam Das, ECS Uniten_US
dc.identifier.citation37p.en_US
dc.identifier.urihttp://hdl.handle.net/10263/6965
dc.language.isoenen_US
dc.publisherIndian Statistical Institute, Kolkataen_US
dc.relation.ispartofseriesDissertation;18-399
dc.subjectK-means clusteringen_US
dc.subjectHigh-dimensional data clusteringen_US
dc.subjectFeature selectionen_US
dc.subjectSparsityen_US
dc.subjectIF-PCAen_US
dc.subjectMinMax k-meansen_US
dc.titleSparse min-max k-means algorithm for high-dimensional data clusteringen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Diss-399.pdf
Size:
865.03 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Dissertations - M Tech (CS)