01-10-2009, 06:53 AM
DATA MINING BASED PROJECTS
=>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
=>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
=>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
=>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
=>Efficient Approximate Query Processing in Peer-to-Peer Networks
=>Ontology-Based Service Representation and Selection
=>Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets
=>Semi-supervised Regression with Co-training-Style Algorithms
=>Evaluation of Clustering with Banking Credit Card segment
=>An efficient clustering algorithm for huge dimensional database
=>Novel approach for Targeted Association Querying
=>Hiding Sensitive Association Rules with Limited Side Effects
=>A Relation-Based Search Engine in Semantic Web
=>Classifier Ensembles with a Random Linear Oracle
=>An Efficient Web Page Change Detection System Based on an Optimized Hungarian Algorithm
=>Mining Nonambiguous Temporal Patterns for Interval-Based Events
=>Peer-to-Peer in Metric Space and Semantic Space
=>Adaptive Index Utilization in Memory-Resident Structural Joins
=>On Three Types of Covering-Based Rough Sets
=>Discovering Frequent Generalized Episodes When Events Persist for Different Durations
=>Efficient and Scalable Algorithms for Inferring Likely Invariants in Distributed Systems
=>Mining Closed Frequent item set using CHARM algorithm
=>Integrating Constraints and Metric Learning in Semi-Supervised Clustering
=>Foundational Approach to Mining Item set Utilities from Databases
=>Fast Frequent Pattern Mining
=>Evaluation for Mining Share Frequent item sets Containing Infrequent Subsets
