Projects

DATA MINING BASED PROJECTS

 

    1. Building a Multiple-Criteria Negotiation Support System
  1. An Exploratory Study of Database Integration Processes
  2. COFI approach for Mining Frequent Item sets
  3. Online Random Shuffling of Large Database Tables
  4. A Flexible Content Adaptation System Using a Rule-Based Approach
  5. Efficient Revalidation of XML Documents
  6. Practical Algorithms and Lower Bounds for Similarity Search in Massive Graphs
  7. Enhancing the Effectiveness of Clustering with Spectra Analysis
  8. Efficient Monitoring Algorithm for Fast News Alerts
  9. Top-k Monitoring in Wireless Sensor Networks
  10. Frequent Closed Sequence Mining without Candidate Maintenance
  11. Maintaining Strong Cache Consistency for the Domain Name System
  12. Efficient Skyline and Top-k Retrieval in Subspaces
  13. Efficient Process of Top-k Range-Sum Queries over Multiple Streams with Minimized Global Error
  14. Fast Nearest Neighbor Condensation for Large Data Sets Classification
  15. Wildcard Search in Structured Peer-to-Peer Networks
  16. Neural-Based Learning Classifier Systems
  17. Discovering Frequent Agreement Sub trees from Phylogenetic Data
  18. Watermarking Relational Databases Using Optimization-Based Techniques
  19. Extracting Actionable Knowledge from Decision Trees
  20. A Requirements Driven Framework for Benchmarking Semantic Web Knowledge Base Systems
  21. The Threshold Algorithm: From Middleware Systems to the Relational Engine
  22. Rank Aggregation for Automatic Schema Matching
  23. Rule Extraction from Support Vector Machines: A Sequential Covering Approach
  24. Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions
  25. A Note on Linear Time Algorithms for Maximum Error Histograms
  26. Toward Exploratory Test-Instance-Centered Diagnosis in High-Dimensional Classification
  27. An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
  28. A Method for Estimating the Precision of Place name Matching
  29. Efficiently Querying Large XML Data Repositories: A Survey
  30. Graph-Based Analysis of Human Transfer Learning Using a Game Tested
  31. Evaluating Universal Quantification in XML
  32. Customer Profiling & Segmentation using Data Mining Techniques
  33. Efficient Frequent Item set Mining Using Global Profit Weighted (GPW) Support Threshold
  34. Fast Algorithms for Frequent Item set Mining using FP-Trees
  35. Mining Confident Rules without Support Requirement
  36. Mining Frequent Item set without Support Threshold
  37. unified framework for utility based measures
  38. An Adaptation of the Vector-Space Model for Ontology-Based Information Retrieval
  39. The Google Similarity Distance
  40. Reverse Nearest Neighbors Search in Ad Hoc Subspaces
  41. Quality-Aware Sampling and Its Applications in Incremental Data Mining
  42. An Exact Data Mining Method for Finding Center Strings and All Their Instances
  43. Negative Samples Analysis in Relevance Feedback
  44. Bayesian Networks for Knowledge-Based Authentication
  45. Continuous Nearest Neighbor Queries over Sliding Windows
  46. The Concentration of Fractional Distances
  47. Efficient Approximate Query Processing in Peer-to-Peer Networks
  48. Ontology-Based Service Representation and Selection
  49. Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets
  50. Semi-supervised Regression with Co-training-Style Algorithms
  51. Evaluation of Clustering with Banking Credit Card segment
  52. An efficient clustering algorithm for huge dimensional database
  53. Novel approach for Targeted Association Querying
  54. Hiding Sensitive Association Rules with Limited Side Effects
  55. A Relation-Based Search Engine in Semantic Web
  56. Classifier Ensembles with a Random Linear Oracle
  57. An Efficient Web Page Change Detection System Based on an Optimized Hungarian Algorithm
  58. Mining Nonambiguous Temporal Patterns for Interval-Based Events
  59. Peer-to-Peer in Metric Space and Semantic Space
  60. Adaptive Index Utilization in Memory-Resident Structural Joins
  61. On Three Types of Covering-Based Rough Sets
  62. Discovering Frequent Generalized Episodes When Events Persist for Different Durations
  63. Efficient and Scalable Algorithms for Inferring Likely Invariants in Distributed Systems
  64. Mining Closed Frequent item set using CHARM algorithm
  65. Integrating Constraints and Metric Learning in Semi-Supervised Clustering
  66. Foundational Approach to Mining Item set Utilities from Databases
  67. Fast Frequent Pattern Mining
  68. Evaluation for Mining Share Frequent item sets Containing Infrequent Subsets
  69.  


Tags :
0
Your rating: None