IEEE 2012 Projects :: Datamining – Titles & Abstracts

Get it Now! 5000+ IEEE Project Lists
Elysium feels proud in building strategic long-term relationships with the clients across worldwide. We believe that the best solutions evolve from the collaborative relationships with our clients. As a global consultant, we work closely with the clients to understand their unique business transformation goals, design best-in-class solutions and devise the most efficient plan for implementing their strategy across the organization.
Our ETPL is renowned for our reputed services in offering real time projects for the students of engineering and science stream. Our prime motto is to fulfill the needs of the students in every aspect of our work. We also extend our guidance services to the research scholars.
- No.1 : Project Leader in India
- 1,00,000 Sucessive Stories
- 100% Satisfaction
- 100% Privacy
- 5000+ IEEE Project Titles
- Qualified Staff Members
- 24/7 Help Desk Support

Your Information will never be shared
IEEE Titles 2012 :: Datamining
1 |
A Decision-Theoretic Framework for Numerical Attribute Value Reconciliation |
2 |
A Framework for Learning Comprehensible Theories in XML Document Classification |
3 |
A Framework for Personal Mobile Commerce Pattern Mining and Prediction |
4 |
A Framework for Similarity Search of Time Series Cliques with Natural Relations |
5 |
A Genetic Programming Approach to Record Deduplication |
6 |
A Knowledge-Driven Approach to Activity Recognition in Smart Homes |
7 |
A Link-Based Cluster Ensemble Approach for Categorical Data Clustering |
8 |
A Look-Ahead Approach to Secure Multiparty Protocols |
9 |
A Multidimensional Sequence Approach to Measuring Tree Similarity |
10 |
A Probabilistic Scheme for Keyword-Based Incremental Query Construction |
11 |
A Query Formulation Language for the Data Web |
12 |
A Temporal Pattern Search Algorithm for Personal History Event Visualization |
13 |
A Unified Probabilistic Framework for Name Disambiguation in Digital Library |
14 |
A Variational Bayesian Framework for Clustering with Multiple Graphs |
15 |
Agglomerative Mean-Shift Clustering |
16 |
An Efficient Formulation of the Improved Visual Assessment of Cluster Tendency (iVAT) Algorithm |
17 |
Anonimos: An LP based Approach for Anonymizing Weighted Social Network Graphs |
18 |
Anomaly Detection for Discrete Sequences: A Survey |
19 |
Answering General Time-Sensitive Queries |
20 |
BibPro: A Citation Parser Based on Sequence Alignment |
21 |
Clustering with Multiviewpoint-Based Similarity Measure |
22 |
Cluster-Oriented Ensemble Classifier: Impact of Multicluster Characterization on Ensemble Classifier Learning |
23 |
CoCITe—Coordinating Changes in Text |
24 |
Combining Tag and Value Similarity for Data Extraction and Alignment |
25 |
Continuous Detour Queries in Spatial Networks |
26 |
Continuous Top-k Dominating Queries |
27 |
Creating Evolving User Behavior Profiles Automatically |
28 |
D-Cache: Universal Distance Cache for Metric Access Methods |
29 |
DDD: A New Ensemble Approach for Dealing with Concept Drift |
30 |
Dense Subgraph Extraction with Application to Community Detection |
31 |
Discover Dependencies from Data—A Review |
32 |
Document Clustering in Correlation Similarity Measure Space |
33 |
Dynamic In-Page Logging for B+ tree Index |
34 |
Effective and Efficient Shape-Based Pattern Detection over Streaming Time Series |
35 |
Effective Pattern Discovery for Text Mining |
36 |
Efficient Computation of Range Aggregates against Uncertain Location-Based Queries |
37 |
Efficient Extended Boolean Retrieval |
38 |
Efficient Fuzzy Type-Ahead Search in XML Data |
39 |
Efficient Processing of Uncertain Events in Rule-Based Systems |
40 |
Efficiently Indexing Large Sparse Graphs for Similarity Search |
41 |
Energy-Efficient Reverse Skyline Query Processing over Wireless Sensor Networks |
42 |
Evaluating Path Queries over Frequently Updated Route Collections |
43 |
Extending Attribute Information for Small Data Set Classification |
44 |
Extending Attribute Information for Small Data Set Classification |
45 |
Fast Elastic Peak Detection for Mass Spectrometry Data Mining |
46 |
Feature Selection Based on Class-Dependent Densities for High-Dimensional Binary Data |
47 |
Fractal-Based Intrinsic Dimension Estimation and Its Application in Dimensionality Reduction |
48 |
Fuzzy Orders-of-Magnitude-Based Link Analysis for Qualitative Alias Detection |
49 |
Holistic Top-k Simple Shortest Path Join in Graphs |
50 |
Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques |
51 |
Load Shedding in Mobile Systems with MobiQual |
52 |
Locally Consistent Concept Factorization for Document Clustering |
53 |
Incremental Information Extraction Using Relational Databases |
54 |
Labeling Dynamic XML Documents: An Order-Centric Approach |
55 |
Learning a Propagable Graph for Semisupervised Learning: Classification and Regression |
56 |
Learning Bregman Distance Functions for Semi-Supervised Clustering |
57 |
Locally Discriminative Coclustering |
58 |
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering |
59 |
Manifold Adaptive Experimental Design for Text Categorization |
60 |
Measuring the Sky: On Computing Data Cubes via Skylining the Measures |
61 |
Mining Low-Support Discriminative Patterns from Dense and High-Dimensional Data |
62 |
Mining Online Reviews for Predicting Sales Performance: A Case Study in the Movie Domain |
63 |
Mining Web Graphs for Recommendations |
64 |
Model-Based Method for Projective Clustering |
65 |
Mutual Information-Based Supervised Attribute Clustering for Microarray Sample Classification |
66 |
On Group Nearest Group Query Processing |
67 |
On the Complexity of View Update Analysis and Its Application to Annotation Propagation |
68 |
On the Deep Order-Preserving Submatrix Problem: A Best Effort Approach |
69 |
On the Spectral Characterization and Scalable Mining of Network Communities |
70 |
Optimizing Bloom Filter Settings in Peer-to-Peer Multikeyword Searching |
71 |
Optimizing the Calculation of Conditional Probability Tables in Hybrid Bayesian Networks Using Binary Factorization |
72 |
Organizing User Search Histories |
73 |
Outsourced Similarity Search on Metric Data Assets |
74 |
Practical Efficient String Mining |
75 |
Privacy Preserving Decision Tree Learning Using Unrealized Data Sets |
76 |
Publishing Search Logs—A Comparative Study of Privacy Guarantees |
77 |
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators |
78 |
Ranking Model Adaptation for Domain-Specific Search |
79 |
Resilient Identity Crime Detection |
80 |
ROAD: A New Spatial Object Search Framework for Road Networks |
81 |
Saturn: Range Queries, Load Balancing and Fault Tolerance in DHT Data Systems |
82 |
Scalable Learning of Collective Behavior |
83 |
Scalable Scheduling of Updates in Streaming Data Warehouses |
84 |
Segmentation and Sampling of Moving Object Trajectories Based on Representativeness |
85 |
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints |
86 |
Slicing: A New Approach for Privacy Preserving Data Publishing |
87 |
Software Fault Prediction Using Quad Tree-Based K-Means Clustering Algorithm |
88 |
SPIRE: Efficient Data Inference and Compression over RFID Streams |
89 |
Subspace Similarity Search under Lp-Norm |
90 |
Synthesizing Ontology Alignment Methods Using the Max-Sum Algorithm |
91 |
Tree-Based Mining for Discovering Patterns of Human Interaction in Meetings |
92 |
TSCAN: A Content Anatomy Approach to Temporal Topic Summarization |
93 |
Understanding Errors in Approximate Distributed Latent Dirichlet Allocation |
94 |
Using Rule Ontology in Repeated Rule Acquisition from Similar Web Sites |
95 |
Visual Role Mining: A Picture Is Worth a Thousand Roles |
96 |
Weakly Supervised Joint Sentiment-Topic Detection from Text |