Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Kavitha, R.
- Privacy Preserving Data Mining at Different Trust Levels
Abstract Views :159 |
PDF Views:2
Authors
Affiliations
1 Velammal College of Engineering and Technology, Madurai, IN
2 Department of Computer Science, Velammal College of Engineering and Technology, Madurai, IN
3 Sri Ramakrishna Engineering College, Coimbatore, IN
4 Hindustan University, Chennai, IN
1 Velammal College of Engineering and Technology, Madurai, IN
2 Department of Computer Science, Velammal College of Engineering and Technology, Madurai, IN
3 Sri Ramakrishna Engineering College, Coimbatore, IN
4 Hindustan University, Chennai, IN
Source
Data Mining and Knowledge Engineering, Vol 5, No 3 (2013), Pagination: 123-128Abstract
Privacy preserving data mining has become increasingly popular because it allows sharing of privacy sensitive data for analysis purposes. So people have become increasingly unwilling to share their data, frequently resulting in individuals either refusing to share their data or providing incorrect data.The difficulty in privacy-sensitive domain is solved by the development of the Multi-Level Trust Privacy Preserving Data Mining (MLT-PPDM) where multiple differently perturbed copies of the same data are available to data miners at different trusted levels. In MLT-PPDM data owners generate perturbed data by various techniques like Batch generation and On-demand generation. MLT-PPDM can overcome the diversity attacks. Partial information hiding methodologies like random perturbation, random rotation perturbation are incorporated with MLT-PPDM to enhance data security and to prevent leakage of the sensitive data. The solution allows a data owner to generate perturbed copies of its data for arbitrary trust levels on demand. Finally MLT-PPDM approach is improved to tackle against the non-linear attacks. The time and space complexities are calculated for both techniques and the results show that on-demand algorithm is best among them.Keywords
Gaussian Noise, Multi-Level Trust, Partial Information Hiding, Perturbation Technique, Single Level Trust.- Intellectual Question Categorization for Assessing the Learner Performance in E-Learning
Abstract Views :167 |
PDF Views:4
Authors
Affiliations
1 Department of MCA, Aloysius Institute of Management and Information Technology (AIMIT), Mangalore, Karnataka, IN
1 Department of MCA, Aloysius Institute of Management and Information Technology (AIMIT), Mangalore, Karnataka, IN
Source
Data Mining and Knowledge Engineering, Vol 3, No 8 (2011), Pagination: 454-458Abstract
E-learning plays a critical role in education. Each learner is having their own way of learning style that cannot be assessed in an exclusive way. They should not be evaluated only on number of right and wrong answers. Testing must be intelligent to pose intellectual questions based on the performance during the session. So, questions have to be classified based on the item difficulty using item responses. The study involves the categorization of questions based on ANN and ANFIS techniques. This paper reports the investigation of the effectiveness and performances of these methods to observe the question classification abilities depending on item responses, item difficulty and question levels. The effectiveness of these methods was evaluated by comparing the performance and class correctness. The comparative test performance analysis based on error rating revealed that ANFIS yield better performance. This study is focused because, each item affects a students' overall success throughout the test in terms of difficulty.Keywords
Intellectual Question Classification, E-Learning, ANFIS.- Data Warehouse Automation–A Review
Abstract Views :206 |
PDF Views:1
Authors
A. S. Kavitha
1,
R. Kavitha
1
Affiliations
1 Department of Computer Science, P.S.G.R. Krishnammal College for Women, Coimbatore, IN
1 Department of Computer Science, P.S.G.R. Krishnammal College for Women, Coimbatore, IN