SPIRO, Spiro, project for student, student projects
A RESEARCH & DEVELOPMENT ORGANIZATION

For Project Enquiry +91 9962 067 067

Slideshow Image 1
Active Learning of Constraints for Semi Supervised Clustering
Post Your concept Get Project
Guidance
It is purposely dedicated for innovative students. Here we encourage students who have new concepts and projects in various domains.

For Project Title


Project Zone > Software > Data Mining

Social share: Facebook SPIRO Google Plus

Active Learning of Constraints for Semi - Supervised Clustering

Category : Data Mining


Sub Category : DOTNET


Project Code : ITDDM21


Project Abstract

ACTIVE LEARNING OF CONSTRAINTS FOR

SEMI-SUPERVISED CLUSTERING

 

 

ABSTRACT

 

For clustering biomedical documents, we can consider three different types of information: the local-content (LC) information from documents, the global-content (GC) information from the whole document collections, and the medical subject heading (MeSH)-semantic (MS) information. Previous methods for clustering biomedical documents are not necessarily effective for integrating different types of information, by which only one or two types of information have been used. Recently, the performance of document clustering has been enhanced by linearly combining both the LC and MS information. However, the simple linear combination could be ineffective because of the limitation of the representation space for combining different types of information (similarities) with different reliability. Semi supervised clustering to select a pair-wise must link and cannot link constraints. We consider active learning as an iteration process which means, an each iteration queries are selected based on the current clustering solution and existing constraint set. We apply a general framework that builds on the concept of neighborhood, where neighborhoods contain “labeled examples” of different clusters according to the pair-wise constraints. Here the active learning method expands the neighborhoods by selecting informative points and querying their relationship with neighborhoods. To resolve uncertainty problem and to select queries that have a highest information rate. We evaluate the proposed method on the benchmark data sets and the results demonstrate consistent and substantial improvements over the current state of the art.

 

 

 

 

 

 

 

EXISTING SYSTEM

PROPOSED SYSTEM

EXISTING CONCEPT:-

In existing, using pair-wise queries to make informative points and it may take multiple queries to resolve the uncertainty about a data point.

This system as uncertainty based sampling for supervised learning; an active learner queries the instance about which the label uncertainty is maximized. The probability making an instance learned clusters.

PROPOSED CONCEPT:-

To improve clustering performance with the help of user-provided side information. Pair-wise constraint is most useful for clustering documents that belongs to be link or cannot link on the same cluster.

We consider active learning of constraints in an iterative framework. Such an iterative framework is widely used in active learning for supervised classification and has been generally observed to outperform non-iterative methods, where the whole set of queries is selected in a single batch.

EXISTING ALGORITHM:-

Uncertainty-based sampling algorithm or mixture Gaussians algorithm

PROPOSED TECHNIQUE:-

Two phase technique such as Explore and Consolidate

ALGORITHM DEFINITION:-

A Gaussian mixture model is a probabilistic model that assumes all the data points are generated from a mixture of a finite number of Gaussian distributions with unknown parameters.

TECHNIQUE DEFINITION:-

The process of eliminating artificial variables is performed in phase-I of the solution and phase-II is used to get an optimal solution. Since the solution of LPP is computed in two phases, it is called as Two-Phase Method.

DRAWBACKS:-

A label uncertainty is maximized while learning queries

Not In accurate and misleading

ADVANTAGES:-

Query efficiency

 

Accurate clustering

 
 
MILE STONES
GUARANTEES
CONTACT US
 
Training and Developemet, Engg Projects
So far we have provided R&D training for more than 1,00,000 engineering Students.
Latest Projects 2012, Latest Technologiy Project
Had conducted seminars in the recent trends of technology at various colleges.
Our research projects had been presented in various National & International Conferences.
Most of our projects were identified by the industries as suitable for their needs.
Our n-number of students got research scholarship to extend our assisted projects for further development.
   
   
Training and Developemt, Project Development in Chennai
SPIRO guarantees small class sizes.
Final Year Projects
SPIRO guarantees quality instructors.
Student Projects, Stupros
SPIRO guarantees competence.
Projects, student projects
SPIRO guarantees that training from SPIRO will be more cost-effective than training from any other source.
Final Year Projects, Projects, student projects
SPIRO guarantees that students in open-enrollment classes are protected against cancellations and will be able to receive desired training at the cost they expect and in the time frame they have planned.
Projects for student
SPIRO guarantees overall quality with a 100% money-back guarantee. If you're not totally satisfied for any reason, simply withdraw before the second day of any class. Notify the instructor and return all course materials and you will receive a 100% refund.
SPIRO SOLUTIONS PRIVATE LIMITED
For ECE,EEE,E&I, E&C & Mechanical,Civil, Bio-Medical
#1, C.V.R Complex, Singaravelu St, T.Nagar, Chennai - 17,
(Behind BIG BAZAAR)Tamilnadu,India
Mobile : +91-9962 067 067, +91-9176 499 499
Landline : 044-4264 1213
Email: info@spiroprojects.com

For IT, CSE, MSC, MCA, BSC(CS)B.COM(cs)
#78, 3rd Floor, Usman Road, T.Nagar, Chennai-17.
(Upstair Hotel Saravana Bhavan) Tamilnadu,India
Mobile: +91-9791 044 044, +91-9176 644 044
E-Mail: info1@spiroprojects.com
About Us | Project Training | Privacy policy | Disclaimer | Contact Us

Copyright © 2015-2016 Stupros All rights reserved.