Suggest a mini project

Hiiiiii.,.....

Hello everyone...Now I am persuing my B tech (Computer Science) 3rd year.. ๐Ÿ˜› And In 4-1, I have a mini project...There are so many project ideas in this thread..But i am confusing ๐Ÿ˜’ to choose one of them ๐Ÿ˜• ..Can you suggest me an idea for a mini project..Its should be interesting for everyone...I dont have any interest about a particular subject...So, please anyone can suggest me......... ๐Ÿ˜


WINNERS DONT DO DIFFERENT THINGS..THEY DO THINGS DIFFERENTLY...

Replies

  • jhbalaji
    jhbalaji
    How about these they all deal with data mining mate

    1. Rank Aggregation for Automatic Schema Matching
    2. Rule Extraction from Support Vector Machines: A Sequential Covering Approach
    3. Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions
    4. A Note on Linear Time Algorithms for Maximum Error Histograms
    5. Toward Exploratory Test-Instance-Centered Diagnosis in High-Dimensional Classification
    6. An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
    7. A Method for Estimating the Precision of Place name Matching
    8. Efficiently Querying Large XML Data Repositories: A Survey
    9. Graph-Based Analysis of Human Transfer Learning Using a Game Tested
    10. Evaluating Universal Quantification in XML
    11. Customer Profiling & Segmentation using Data Mining Techniques
    12. Efficient Frequent Item set Mining Using Global Profit Weighted (GPW) Support Threshold
    13. Fast Algorithms for Frequent Item set Mining using FP-Trees
    14. Mining Confident Rules without Support Requirement
    15. Mining Frequent Item set without Support Threshold
    16. unified framework for utility based measures
    17. An Adaptation of the Vector-Space Model for Ontology-Based Information Retrieval
    18. The Google Similarity Distance
    19. Reverse Nearest Neighbors Search in Ad Hoc Subspaces
    20. Quality-Aware Sampling and Its Applications in Incremental Data Mining
    21. An Exact Data Mining Method for Finding Center Strings and All Their Instances
    22. Negative Samples Analysis in Relevance Feedback
    23. Bayesian Networks for Knowledge-Based Authentication
    24. Continuous Nearest Neighbor Queries over Sliding Windows
    25. The Concentration of Fractional Distances
    26. Efficient Approximate Query Processing in Peer-to-Peer Networks
    27. Ontology-Based Service Representation and Selection
    28. Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets
    29. Semi-supervised Regression with Co-training-Style Algorithms
    30. Evaluation of Clustering with Banking Credit Card segment
    31. An efficient clustering algorithm for huge dimensional database
    32. Novel approach for Targeted Association Querying
    33. Hiding Sensitive Association Rules with Limited Side Effects
    34. A Relation-Based Search Engine in Semantic Web
    35. Classifier Ensembles with a Random Linear Oracle
    36. An Efficient Web Page Change Detection System Based on an Optimized Hungarian Algorithm
    37. Mining Nonambiguous Temporal Patterns for Interval-Based Events
    38. Peer-to-Peer in Metric Space and Semantic Space
    39. Adaptive Index Utilization in Memory-Resident Structural Joins
    40. On Three Types of Covering-Based Rough Sets
  • Sahithi Pallavi
    Sahithi Pallavi
    jhbalaji
    How about these they all deal with data mining mate

    1. Rank Aggregation for Automatic Schema Matching
    2. Rule Extraction from Support Vector Machines: A Sequential Covering Approach
    3. Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions
    4. A Note on Linear Time Algorithms for Maximum Error Histograms
    5. Toward Exploratory Test-Instance-Centered Diagnosis in High-Dimensional Classification
    6. An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
    7. A Method for Estimating the Precision of Place name Matching
    8. Efficiently Querying Large XML Data Repositories: A Survey
    9. Graph-Based Analysis of Human Transfer Learning Using a Game Tested
    10. Evaluating Universal Quantification in XML
    11. Customer Profiling & Segmentation using Data Mining Techniques
    12. Efficient Frequent Item set Mining Using Global Profit Weighted (GPW) Support Threshold
    13. Fast Algorithms for Frequent Item set Mining using FP-Trees
    14. Mining Confident Rules without Support Requirement
    15. Mining Frequent Item set without Support Threshold
    16. unified framework for utility based measures
    17. An Adaptation of the Vector-Space Model for Ontology-Based Information Retrieval
    18. The Google Similarity Distance
    19. Reverse Nearest Neighbors Search in Ad Hoc Subspaces
    20. Quality-Aware Sampling and Its Applications in Incremental Data Mining
    21. An Exact Data Mining Method for Finding Center Strings and All Their Instances
    22. Negative Samples Analysis in Relevance Feedback
    23. Bayesian Networks for Knowledge-Based Authentication
    24. Continuous Nearest Neighbor Queries over Sliding Windows
    25. The Concentration of Fractional Distances
    26. Efficient Approximate Query Processing in Peer-to-Peer Networks
    27. Ontology-Based Service Representation and Selection
    28. Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets
    29. Semi-supervised Regression with Co-training-Style Algorithms
    30. Evaluation of Clustering with Banking Credit Card segment
    31. An efficient clustering algorithm for huge dimensional database
    32. Novel approach for Targeted Association Querying
    33. Hiding Sensitive Association Rules with Limited Side Effects
    34. A Relation-Based Search Engine in Semantic Web
    35. Classifier Ensembles with a Random Linear Oracle
    36. An Efficient Web Page Change Detection System Based on an Optimized Hungarian Algorithm
    37. Mining Nonambiguous Temporal Patterns for Interval-Based Events
    38. Peer-to-Peer in Metric Space and Semantic Space
    39. Adaptive Index Utilization in Memory-Resident Structural Joins
    40. On Three Types of Covering-Based Rough Sets

    Oh....all these are the project ideas about datamining>........๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’๐Ÿ˜’

    WINNERS DONT DO DIFFERENT THINGS...THEY DO THINGS DIFFRENTLY...

You are reading an archived discussion.

Related Posts

Hi.... Its very sad to say My sir is not explaning DBMS clearly and neatly. ๐Ÿ˜” ๐Ÿ˜” ๐Ÿ˜” .I think it is a important subject for CS/IT students...Can anyone suggest...
Where should i get the letest project information?๐Ÿ˜•
please send link for downloading best book for bsnl JTO EXAM preparation
Hi, I have a question regarding a hydraulic pressure with embedded water turbine mechanism. The hydraulic cylinder contains two cylinder barrels of different diameters. For example the top cylinder barrel...
What will happen if we connect +5V at both the terminals of a diode? It will be RB or FB?