Bookmark and Share

Friday, 27 May 2011

Data Mining Projects Lis

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


Post a Comment

There was an error in this gadget