Proiect

Data Mining & Data

Warehousing, ABD & MTI

1
 Planificare
 Proiectul este individual!
 Selectie tema: Saptamana 2
 Prezentari orale: Saptamanile 3-11.
 Prezentarile PPT vor fi incarcate si
pe situl de curs pana in saptamana
13.
 Testare algoritm: Saptamanile 3-12
 Predarea proiectului: Saptamanile
13-14 (la orele de proiect)

2
 Teme posibile (algoritmi)
Pot fi propuse si alte teme, daca se incadreaza in domeniul Data Mining.
Iata o lista cu cativa algoritmi posibil de ales:
1. Interpolation: Kriging
2. Dealing with missing data: Imputation
3. Dimensionality reduction: PCA (Principal component analysis)
4. Frequent Itemset Mining: Patricia Mine
5. Frequent Itemset Mining: Eclat
6. Frequent Itemset Mining: TreeProjection
7. Frequent Itemset Mining: COFI
8. Frequent Itemset Mining: TM - Transaction Mapping
9. Frequent Itemset Mining: P-Mine (Parallel itemset mining)
10. Frequent Itemset Mining: LP-Growth
11. Frequent Itemset Mining: Can Mining
12. Frequent Itemset Mining: Extract
13. Sequence Mining: SPADE
14. Sequence Mining: FreeSpan
15. Sequence Mining: PrefixSpan
16. Sequence Mining: MAPres
3
 Teme posibile (algoritmi)
17. Decision Trees: CART
18. Decision Trees: CHAID
19. Decision Trees: Gradient Boosting Decision Tree
20. Decision Trees: SLIQ
21. Clustering: Gaussian Mixture Models
22. Clustering: DBScan
23. Clustering: OPTICS
24. Clustering: CLARA
25. Clustering: CLARANS
26. Clustering: CURE
27. Clustering: BIRCH
28. Clustering: O-cluster
29. Clustering: SUBCLU
30. Clustering: Canopi
31. Clustering: Nearest-neighbor chain algorithm
32. Clustering: Expectation-Maximization
33. Web mining: Page Rank
34. Web mining: Topic Sensitive Page Rank (TSPR)
35. Web mining: HITS (Hyperlink-Induced Topic Search) 4
36. Web mining: Salsa
 Teme posibile (algoritmi)
37. Network Analysis: Peaky Topics
38. Network Analysis: Online-LDA
39. Network Analysis: DAVA (Data-Aware Vaccine Allocation Over Large
Networks)
40. Network Analysis: MABED (Mention-anomaly-based event detection)
41. Network Analysis: TSTE (Temporal and Social Terms Evaluation)
42. Network Analysis: SDNML (Sequentially Discounting Normalized
Maximum Likelihood)
43. Network Analysis: MACD (Moving Average Convergence Divergence)
44. Topic Modeling: Latent Semantic Indexing
45. Topic Modeling: Latent Dirichlet Allocation
46. Topic Modeling: Non-negative Matrix Factorization
47. Topic Modeling: Hierarchical Dirichlet Process
48. Word embeddings: Word2Vec
49. Word embeddings: FastText
50. Word embeddings: GloVe
51. Word embeddings: Mittens
52. Word embeddings: MOE
53. Word embeddings: BERT
54. Word embeddings: ALBERT 5
 Teme posibile (algoritmi)
55. Neural Networks: Learning Vector Quantization
56. Neural Networks: Self-organizing maps
57. Neural Networks: Perceptron
58. Neural Networks: Multi-layer Perceptron
59. Neural Networks: Recurrent Neural Networks
60. Neural Networks: Long-Short Term Memory
61. Neural Networks: Gated Recurrent Unit
62. Neural Networks: Convolutional Neural Networks
63. Neural Networks: Deconvolutional Neural Networks
64. Neural Networks: Recurrent Convolutional Neural Networks
65. Neural Networks: Generative Adversarial Network
66. Neural Networks: Boltzmann machine
67. Neural Networks: Restricted Boltzmann machine
68. Neural Networks: Deep Belief Network
69. Neural Networks: Encoder-Decoder Recurrent Neural Network
70. Neural Networks: Attention-Based Convolutional Neural Network

Atentie: Nu toti algoritmii din lista au implementari care pot fi utilizate pentru
proiect. Cand alegeti tema verificati disponibilitatea implementarii! 6
 Livrabile (s13-s14)
 Dosar continand textul tiparit al
proiectului incluzand:
 Importanta si domenii de aplicari in
practica pentru algoritmul ales
 Prezentare generala algoritm
 Rezultate publicate, aspecte semnalate in
literatura
 Seturi de date folosite in testare (nume,
sursa si esantion)
 Rezultate obtinute (inclusiv esantion)
 Evaluarea rezultatelor
 Referinte (pentru algoritm, programe,
seturi de date)

7
 Livrabile - continuare
 Nu este necesar CD. Se va incarca pe
situl de curs inainte de predarea
proiectului o arhiva continand:
 documentul de mai sus in format
electronic,
 prezentarea PPT din timpul semestrului,
 programe, seturi de date si rezultate in
extenso.