You are on page 1of 1

Mini Projects - Data Mining (2013) (Group of Three Students)

1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21.

Mining Confident Rules without Support Requirement Mining Frequent Item set without Support Threshold An Adaptation of the Vector-Space Model for Ontology-Based Information Retrieval The Google Similarity Distance Reverse Nearest Neighbors Search in Ad Hoc Subspaces Quality-Aware Sampling and Its Applications in Incremental Data Mining An Exact Data Mining Method for Finding Center Strings and All Their Instances Negative Samples Analysis in Relevance Feedback Bayesian Networks for Knowledge-Based Authentication Continuous Nearest Neighbor Queries over Sliding Windows Building a Multiple-Criteria Negotiation Support System Flexible Content Adaptation System Using a Rule-Based Approach Frequent Closed Sequence Mining without Candidate Maintenance Customer Profiling & Segmentation using Data Mining Techniques Fast Algorithms for Frequent Item set Mining using FP-Trees Ontology-Based Service Representation and Selection Watermarking Relational Databases Using Optimization-Based Techniques Extracting Actionable Knowledge from Decision Trees A Requirements Driven Framework for Semantic Web Knowledge Base Systems Rank Aggregation for Automatic Schema Matching Rule Extraction from Support Vector Machines: A Sequential Covering Approach

You might also like