modeling recurrent distributions in streams
play

Modeling Recurrent Distributions in Streams using Possible Worlds - PowerPoint PPT Presentation

Modeling Recurrent Distributions in Streams using Possible Worlds Michael Geilke, Andreas Karwath, and Stefan Kramer Johannes Gutenberg-Universitt Mainz, Germany October 20, 2015 Modeling Recurrent Distributions in Streams using Possible


  1. Modeling Recurrent Distributions in Streams using Possible Worlds Michael Geilke, Andreas Karwath, and Stefan Kramer Johannes Gutenberg-UniversitΓ€t Mainz, Germany October 20, 2015

  2. Modeling Recurrent Distributions in Streams using Possible Worlds Smart 2

  3. Modeling Recurrent Distributions in Streams using Possible Worlds Smart 3

  4. Modeling Recurrent Distributions in Streams using Possible Worlds Smart 4

  5. Modeling Recurrent Distributions in Streams using Possible Worlds EDDO Smart 5

  6. Modeling Recurrent Distributions in Streams using Possible Worlds EDDO 𝑔 Smart 6

  7. Modeling Recurrent Distributions in Streams using Possible Worlds EDDO 𝑔 Smart Query 1 [marginalize] What is the data distribution of the sensors in the living room? 7

  8. Modeling Recurrent Distributions in Streams using Possible Worlds EDDO 𝑔 Smart Query 2 [setting hard evidence] Two residents are in the living room. What is the probability that they watch TV? 8

  9. Modeling Recurrent Distributions in Streams using Possible Worlds EDDO 𝑔 Smart Alg 1 Alg 2 POEt Out 1 Out 2 Itemsets 9

  10. Modeling Recurrent Distributions in Streams using Possible Worlds Smart 10

  11. Modeling Recurrent Distributions in Streams using Possible Worlds Smart 11

  12. Modeling Recurrent Distributions in Streams using Possible Worlds EDDO 𝑔 Smart 12

  13. Modeling Recurrent Distributions in Streams using Possible Worlds Recurrences  day and night  working days and weekends Smart  seasons 13

  14. Modeling Recurrent Distributions in Streams using Possible Worlds Recurrences  pattern could be more complex  may only affect a part of the house 14

  15. Modeling Recurrent Distributions in Streams using Possible Worlds Goal: a representation that  is constantly updated  is representing current and historical data distributions,  is able to represent recurrences  provides a query mechanism 15

  16. Modeling Recurrent Distributions in Streams using Possible Worlds Tasks for proposed method 1. recognize regions of drift 2. represent density of data stream segments 3. identify recurrences on the density level 4. identify recurrences between parts of different densities do all of that in an online fashion 16

  17. Modeling Recurrent Distributions in Streams using Possible Worlds Tasks for proposed method 1. recognize regions of drift 2. represent density of data stream segments 3. identify recurrences on the density level 4. identify recurrences between parts of different densities do all of that in an online fashion 17

  18. Modeling Recurrent Distributions in Streams using Possible Worlds Tasks for proposed method 1. recognize regions of drift 2. represent density of data stream segments 3. identify recurrences on the density level 4. identify recurrences between parts of different densities do all of that in an online fashion 18

  19. Modeling Recurrent Distributions in Streams using Possible Worlds Tasks for proposed method 1. recognize regions of drift 2. represent density of data stream segments 3. identify recurrences on the density level 4. identify recurrences between parts of different densities do all of that in an online fashion 19

  20. Modeling Recurrent Distributions in Streams using Possible Worlds Tasks for proposed method 1. recognize regions of drift 2. represent density of data stream segments 3. identify recurrences on the density level 4. identify recurrences between parts of different densities do all of that in an online fashion 20

  21. Modeling Recurrent Distributions in Streams using Possible Worlds Tasks for proposed method 1. recognize regions of drift 2. represent density of data stream segments 3. identify recurrences on the density level 4. identify recurrences between parts of different densities do all of that in an online fashion 21

  22. Modeling Recurrent Distributions in Streams using Possible Worlds Recognize Regions of Drift 22

  23. Modeling Recurrent Distributions in Streams using Possible Worlds Recognize Regions of Drift A B C Window-based approach β€’ extension of an approach by Dries and RΓΌckert 23

  24. Modeling Recurrent Distributions in Streams using Possible Worlds Recognize Regions of Drift A B C 𝑔 𝑔 Window-based approach β€’ extension of an approach by Dries and RΓΌckert β€’ compute density values with current estimate f 24

  25. Modeling Recurrent Distributions in Streams using Possible Worlds Recognize Regions of Drift A B C 𝑔 𝑔 Wilcoxon Window-based approach β€’ extension of an approach by Dries and RΓΌckert β€’ compute density values with current estimate f β€’ perform drift detection with Wilcoxon rank-sum test 25

  26. Modeling Recurrent Distributions in Streams using Possible Worlds Recognize Regions of Drift A B C 𝑔 Window-based approach β€’ extension of an approach by Dries and RΓΌckert β€’ compute density values with current estimate f β€’ perform drift detection with Wilcoxon rank-sum test β€’ update f with clean instances only 26

  27. Modeling Recurrent Distributions in Streams using Possible Worlds Recognize Regions of Drift A B C 𝑔 Window-based approach β€’ extension of an approach by Dries and RΓΌckert β€’ compute density values with current estimate f β€’ perform drift detection with Wilcoxon rank-sum test β€’ update f with clean instances only 27

  28. Modeling Recurrent Distributions in Streams using Possible Worlds Recognize Regions of Drift A B C 𝑔 Window-based approach β€’ extension of an approach by Dries and RΓΌckert β€’ compute density values with current estimate f β€’ perform drift detection with Wilcoxon rank-sum test β€’ update f with clean instances only 28

  29. Modeling Recurrent Distributions in Streams using Possible Worlds Recognize Regions of Drift C Window-based approach β€’ extension of an approach by Dries and RΓΌckert β€’ compute density values with current estimate f β€’ perform drift detection with Wilcoxon rank-sum test β€’ update f with clean instances only 29

  30. Modeling Recurrent Distributions in Streams using Possible Worlds Recurrences of Densities C Recurrent or new? 30

  31. Modeling Recurrent Distributions in Streams using Possible Worlds Recurrences of Densities C 𝑔 𝑗 Recurrent or new? β€’ 𝑔 compare with pool of existing density 3 𝑔 2 estimates 𝑔 1 𝑔 β€’ use statistical test we proposed earlier 5 𝑔 4 β€’ reactivate estimate if one is found β€’ initialize a new one otherwise 31

  32. Modeling Recurrent Distributions in Streams using Possible Worlds Recurrences of Densities C 𝑔 𝑗 Recurrent or new? β€’ 𝑔 compare with pool of existing density 3 𝑔 2 estimates 𝑔 1 𝑔 β€’ use statistical test we proposed earlier 5 𝑔 4 β€’ reactivate estimate if one is found β€’ initialize a new one otherwise 32

  33. Modeling Recurrent Distributions in Streams using Possible Worlds Recurrences of Densities C 𝑔 𝑗 Recurrent or new? β€’ 𝑔 compare with pool of existing density 3 𝑔 2 estimates 𝑔 1 𝑔 β€’ use statistical test we proposed earlier 5 𝑔 4 β€’ reactivate estimate if one is found β€’ initialize a new one otherwise 33

  34. Modeling Recurrent Distributions in Streams using Possible Worlds Recurrences of Densities C 𝑔 𝑗 Recurrent or new? β€’ 𝑔 compare with pool of existing density 3 𝑔 2 estimates 𝑔 1 𝑔 β€’ use statistical test we proposed earlier 5 𝑔 4 β€’ reactivate estimate if one is found β€’ initialize a new one otherwise 34

  35. Modeling Recurrent Distributions in Streams using Possible Worlds Recurrences of Densities C Wilcoxon Recurrent or new? β€’ 𝑔 compare with pool of existing density 3 𝑔 2 estimates 𝑔 1 𝑔 β€’ use statistical test we proposed earlier 5 𝑔 4 β€’ reactivate estimate if one is found β€’ initialize a new one otherwise 35

  36. Modeling Recurrent Distributions in Streams using Possible Worlds Recurrences of Density Parts Introduction of modules 𝑔 π‘Œ 1 , π‘Œ 2 , … , π‘Œ 8 = 𝑔 1 π‘Œ 1 , π‘Œ 3 , π‘Œ 8 βˆ™ 𝑔 2 π‘Œ 2 , π‘Œ 4 , π‘Œ 5 βˆ™ 𝑔 3 π‘Œ 6 βˆ™ 𝑔 4 π‘Œ 7 If the 𝑔 𝑗 cannot be decomposed any further, then 𝑔 1 , 𝑔 2 , 𝑔 3 , 𝑔 4 are called the modules of 𝑔 . 36

  37. Modeling Recurrent Distributions in Streams using Possible Worlds p 1 p 2 p 4 p 3 37

  38. Modeling Recurrent Distributions in Streams using Possible Worlds Query Mechanism β€’ probabilistic extension of possible worlds semantics p 1 p 2 β€’ requires density estimators p 4 supporting inference tasks p 3 38

  39. Modeling Recurrent Distributions in Streams using Possible Worlds Query Mechanism β€’ probabilistic extension of possible worlds semantics p 1 p 2 β€’ requires density estimators p 4 supporting inference tasks p 3 Query 3 [over multiple worlds] Given world W , what is the probability that the resident will switch on the light in the office room? 39

  40. Modeling Recurrent Distributions in Streams using Possible Worlds Evaluation: Modules  evaluation on Datasets Synthetic synthetic and real-world datasets Bayesian networks with  without modules performance is different numbers of nodes, better in many cases, but only slightly different numbers of instances different numbers of variable groups  more explicit representation that Real-World enables detection of recurrences Electricity Shuttle Waterlevel Covertype 40

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend