Linear Predictive Coding and Cepstrum coefficients for mining time - - PowerPoint PPT Presentation

linear predictive coding and cepstrum coefficients for
SMART_READER_LITE
LIVE PREVIEW

Linear Predictive Coding and Cepstrum coefficients for mining time - - PowerPoint PPT Presentation

Linear Predictive Coding and Cepstrum coefficients for mining time variant information from software repositories G. Antoniol, F. Rollo and G. Venturi RCOST Unievrsity of Sannio - Italy LPC Idea Model a time series with a polynomial


slide-1
SLIDE 1

Linear Predictive Coding and Cepstrum coefficients for mining time variant information from software repositories

  • G. Antoniol, F. Rollo and G. Venturi

RCOST – Unievrsity of Sannio - Italy

slide-2
SLIDE 2

LPC Idea

Model a time series with a polynomial

approximation

LPC Cepstrum smooth the spectrum

  • Define the distance between two time series

as the distance between their polynomial approximations

  • Use distance to cluster time series with

identical or similar evolutions.

slide-3
SLIDE 3

LPC and Linux Kernel

211 Linux releases about

1700 files

Study the influence of the

number of coefficients

Study the influence of

distance thresholds

Mine files with similar

evolution:

Create groups of files with

the same or very similar size evolution

100 200 300 400 500 600 700 800 1 14 27 40 53 66 79 92 105 118 131 144 157 170 183 196 209 222 235 248

100 1000 10000 12 16 20 32 1E-3 1E-4 1E-5

Similar pairs for different thresholds and coefficients used Similar pair of evolving files