50 Data Mining Project topics for Computer Science ( CS)


  • Mining Confident Rules without Support Requirement 
  • Mining Frequent Item set without Support Threshold 
  • unified framework for utility based measures 
  • 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 
  • The Concentration of Fractional Distances 
  • Building a Multiple-Criteria Negotiation Support System 
  • An Exploratory Study of Database Integration Processes 
  • COFI approach for Mining Frequent Item sets 
  • Online Random Shuffling of Large Database Tables 
  • A Flexible Content Adaptation System Using a Rule-Based Approach 
  • Efficient Revalidation of XML Documents 
  • Practical Algorithms and Lower Bounds for Similarity Search in Massive Graphs 
  • Enhancing the Effectiveness of Clustering with Spectra Analysis 
  • Efficient Monitoring Algorithm for Fast News Alerts 
  • Top-k Monitoring in Wireless Sensor Networks 
  • Frequent Closed Sequence Mining without Candidate Maintenance 
  • Maintaining Strong Cache Consistency for the Domain Name System 
  • Efficient Skyline and Top-k Retrieval in Subspaces 
  • Efficient Process of Top-k Range-Sum Queries over Multiple Streams with Minimized Global Error 
  • Toward Exploratory Test-Instance-Centered Diagnosis in High-Dimensional Classification 
  • An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data 
  • A Method for Estimating the Precision of Place name Matching 
  • Efficiently Querying Large XML Data Repositories: A Survey 
  • Graph-Based Analysis of Human Transfer Learning Using a Game Tested 
  • Evaluating Universal Quantification in XML 
  • Customer Profiling & Segmentation using Data Mining Techniques 
  • Efficient Frequent Item set Mining Using Global Profit Weighted (GPW) Support Threshold 
  • Fast Algorithms for Frequent Item set Mining using FP-Trees 
  • Efficient Approximate Query Processing in Peer-to-Peer Networks 
  • Ontology-Based Service Representation and Selection 
  • Fast Nearest Neighbor Condensation for Large Data Sets Classification 
  • Wildcard Search in Structured Peer-to-Peer Networks 
  • Neural-Based Learning Classifier Systems 
  • Discovering Frequent Agreement Sub trees from Phylogenetic Data 
  • Watermarking Relational Databases Using Optimization-Based Techniques 
  • Extracting Actionable Knowledge from Decision Trees 
  • A Requirements Driven Framework for Benchmarking Semantic Web Knowledge Base Systems 
  • The Threshold Algorithm: From Middleware Systems to the Relational Engine 
  • Rank Aggregation for Automatic Schema Matching 
  • Rule Extraction from Support Vector Machines: A Sequential Covering Approach 
  • Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions 
  • A Note on Linear Time Algorithms for Maximum Error Histograms 
  • Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets
We are a small team and we need u ! Support Us by Contributing your Projects Seminars Presentations or any other resources. Sent your proposals along with your name and E mail Id to admin@allforbtech.com

Leave a Reply

Your email address will not be published. Required fields are marked *