Please wait, while we are loading the content...
Please wait, while we are loading the content...
Content Provider | IEEE Xplore Digital Library |
---|---|
Author | Ichihashi, H. Notsu, A. Honda, K. |
Copyright Year | 2009 |
Description | Author affiliation: Department of Computer Science and Intelligent Systems, Osaka Prefecture University, 1-1 Gakuen-cho, Naka, Sakai, Osaka, 599-8531, Japan (Ichihashi, H.; Notsu, A.; Honda, K.) |
Abstract | This paper proposes an additional version of the fuzzy c-means based classifier (FCMC). The classifier FCMC-R treats relational data instead of object data. FCMCs use covariance structures to represent flexible shapes of clusters. Despite its effectiveness, the intense computation of covariance matrices is an impediment for classifying a set of high-dimensional feature data. In order to tackle with this problem, we proposed a way of directly handling high-dimensional data, i.e., FCMC-H. The third type of the FCM classifier is the relational classifier FCMC-R, which is derived from FCMC-H. The relational data represented by a relational matrix are based on dissimilarities or distances between object data. The triplets, i.e., FCMC, FCMC-H, and FCMC-R are equivalent when the dimensionality of feature vectors is not very high and the dissimilarity is represented by Euclidean distances. The randomized test set performance of FCMC on the sets of object data from UCI repository is comparable to that of the support vector machine (SVM) classifier. The performances of the triplet in terms of 100 times three way data splits (3-WDS) procedure are compared. The triplet surpasses the k-nearest neighbor (k-NN) classifier, which is a well established and very popular relational classifier. |
Starting Page | 1826 |
Ending Page | 1833 |
File Size | 527239 |
Page Count | 8 |
File Format | |
ISBN | 9781424435968 |
ISSN | 10987584 |
DOI | 10.1109/FUZZY.2009.5277336 |
Language | English |
Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher Date | 2009-08-20 |
Publisher Place | South Korea |
Access Restriction | Subscribed |
Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subject Keyword | Clustering algorithms Testing Support vector machines Support vector machine classification Covariance matrix Convergence Shape Impedance Prototypes Iterative algorithms |
Content Type | Text |
Resource Type | Article |
Subject | Applied Mathematics Artificial Intelligence Theoretical Computer Science Software |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
Sl. | Authority | Responsibilities | Communication Details |
---|---|---|---|
1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
Loading...
|