<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Jamie's Junk : Time Series</title><link>http://blogs.msdn.com/jamiemac/archive/tags/Time+Series/default.aspx</link><description>Tags: Time Series</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>KDD 2008 and Incredibly Awesome SQL 2008 Data Mining Demos</title><link>http://blogs.msdn.com/jamiemac/archive/2008/08/25/kdd-2008-and-incredibly-awesome-sql-2008-data-mining-demos.aspx</link><pubDate>Mon, 25 Aug 2008 21:48:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:8894752</guid><dc:creator>JamieMac</dc:creator><slash:comments>3</slash:comments><comments>http://blogs.msdn.com/jamiemac/comments/8894752.aspx</comments><wfw:commentRss>http://blogs.msdn.com/jamiemac/commentrss.aspx?PostID=8894752</wfw:commentRss><description>&lt;P&gt;Bogdan and Raman are currently outside of Las Vegas at the KDD 2008 (Knowledge Discovery and Data Mining) conference.&amp;nbsp; At the conference they are showing all the goodness that is SQL Server 2008 Data Mining, but also a "secret project" that Bogdan has been working on all summer - &lt;STRONG&gt;Data Mining in the Cloud&lt;/STRONG&gt;.&amp;nbsp; That's right - access to the awesome data mining functionality of SQL Server 2008 with no local Analysis Services server.&lt;/P&gt;
&lt;P&gt;Currently the technology demonstration allows you to access the Table Analysis Tools for Excel 2007 by connecting to our hosted data mining service, meaning you can use the Table Analysis Tools anywhere at anytime without connectivity to your local IT infrastructure.&amp;nbsp; &lt;STRONG&gt;Additionally&lt;/STRONG&gt; there is a web interface that allows you to upload a limited amount of data and play with the tools &lt;STRONG&gt;without even having Excel!&lt;/STRONG&gt;&amp;nbsp; Currently only a few of the tools are implemented in the web interface.&amp;nbsp; If for any reason you haven't had a chance to grab those amazing Table Analysis Tools and see what SQL Server Data Mining can do for you - run, don't walk, over to &lt;A href="http://www.sqlserverdatamining.com/cloud/"&gt;http://www.sqlserverdatamining.com/cloud/&lt;/A&gt;&amp;nbsp;and try them out right now!&lt;/P&gt;
&lt;P&gt;Not to limit ourselves to revolutionary cloud data mining technology, the data mining team here in SQL Server also created another demo application that clearly shows the amazing advances in our Time Series algorithm.&amp;nbsp; Shuvro and Tatyana put together an incredible application that front ends the time series capabilities of SQL Server 2008.&amp;nbsp; In this application, you not only get a simple interface for creating time series models resulting in a chart showing the historical and forecasted data, but you can also hover over any forecasted points and it will highlight all the data points in that series and other series that have an impact on the prediction!&amp;nbsp; &lt;STRONG&gt;Even more&lt;/STRONG&gt;, you can click and drag forecasted values to see how they change future predictions!&amp;nbsp; &lt;STRONG&gt;Even more,&lt;/STRONG&gt;&amp;nbsp;the application will show you all the DMX statements that it uses to create these models and generate these forecasts.&amp;nbsp; This demo is truly an incredible piece of work.&amp;nbsp; You can find out more about the demo and how to download it at &lt;A href="http://www.sqlserverdatamining.com/ssdm/Home/TipsTricks/tabid/61/Default.aspx?id=383"&gt;http://www.sqlserverdatamining.com/ssdm/Home/TipsTricks/tabid/61/Default.aspx?id=383&lt;/A&gt;.&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=8894752" width="1" height="1"&gt;</description><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Time+Series/default.aspx">Time Series</category><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Addins/default.aspx">Addins</category><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Cloud/default.aspx">Cloud</category></item><item><title>How can we mine?  Let me count the ways...</title><link>http://blogs.msdn.com/jamiemac/archive/2007/11/19/how-can-we-mine-let-me-count-the-ways.aspx</link><pubDate>Tue, 20 Nov 2007 00:18:10 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:6410880</guid><dc:creator>JamieMac</dc:creator><slash:comments>1</slash:comments><comments>http://blogs.msdn.com/jamiemac/comments/6410880.aspx</comments><wfw:commentRss>http://blogs.msdn.com/jamiemac/commentrss.aspx?PostID=6410880</wfw:commentRss><description>&lt;p&gt;Recently I received some customer feedback that SQL Server Data Mining &amp;quot;doesn't have enough algorithms.&amp;quot;&amp;#160; More specifically, the comment was that we have the same capabilities are other Data Mining providers, we just &amp;quot;hide&amp;quot; many facilities as algorithm parameters rather than separating out each as a named algorithm.&amp;#160; So let's count the Microsoft algorithms a few different ways to work this out.&lt;/p&gt;  &lt;p&gt;First - let's go by the box.&amp;#160; This is the list of algorithms as specified in Books Online&lt;/p&gt;  &lt;ol&gt;   &lt;li&gt;Microsoft Decision Trees&lt;/li&gt;    &lt;li&gt;Microsoft Clustering&lt;/li&gt;    &lt;li&gt;Microsoft Naive Bayes&lt;/li&gt;    &lt;li&gt;Microsoft Association Rules&lt;/li&gt;    &lt;li&gt;Microsoft Neural Networks&lt;/li&gt;    &lt;li&gt;Microsoft Time Series&lt;/li&gt;    &lt;li&gt;Microsoft Sequence Clustering&lt;/li&gt;    &lt;li&gt;Microsoft Linear Regression&lt;/li&gt;    &lt;li&gt;Microsoft Logistic Regression&lt;/li&gt; &lt;/ol&gt;  &lt;p&gt;So that's nine - count 'em &lt;em&gt;nine&lt;/em&gt; algorithms.&amp;#160;&amp;#160; But that's just one way.&amp;#160; If you look at my book, Data Mining with SQL Server 2005 written with Zhaohui Tang, there are only &lt;em&gt;seven &lt;/em&gt;algorithms!&amp;#160; What?&amp;#160; You say!&amp;#160; How can it be?&lt;/p&gt;  &lt;p&gt;Let me explain.&amp;#160; During the development of SQL Server 2005, we realized a couple of tricks; 1) linear regression was the same as our tree algorithm,&amp;#160; just forced to not split; and 2) logistic regression was the same as our Neural Nets, just with zero hidden layers.&amp;#160; However, we got similar feedback - people want &lt;em&gt;more algorithms&lt;/em&gt;, and specifically these ones, so we set up two &amp;quot;new algorithms&amp;quot; by forcibly setting parameters on the Decision Tree and Neural Network algorithms and voila! we shipped with nine named algorithms.&amp;#160; It would have been hard to fill up two entire chapters explaining that last sentence, so Zhaohui and I decided just to stick to the seven core algorithms.&lt;/p&gt;  &lt;p&gt;Anyway, this posting isn't really about how to count &lt;em&gt;less&lt;/em&gt; algorithms, I really wanted to show you how to count &lt;em&gt;more.&amp;#160; &lt;/em&gt;When we set about designing SQL Server Data Mining, we really and truly tried to make data mining operations simpler.&amp;#160; We thought at the time, rightly or wrongly, that the more options end users have, the more complicated and difficult the product would be to use.&amp;#160; Therefore, we tried to determine the best behavior in a class, and make more advanced options available through parameters.&lt;/p&gt;  &lt;p&gt;For example, take our clustering algorithm.&amp;#160; We assumed that if people wanted clustering, most likely didn't care about the details of the algorithm, they just wanted to get the job done, and that those people who wanted more would look for it (the design principal - make the simple things simple, and the complex things possible).&amp;#160; So we bundled up different flavors of clustering into a single package that many vendors would have broken apart.&amp;#160; So let's start counting with clustering.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;1&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Our default clustering behavior is &lt;strong&gt;EM (Expectation Maximization) clustering&lt;/strong&gt; using the Bradley-Fayyad scalable framework&lt;/p&gt; &lt;strong&gt;&lt;font size="5"&gt;&lt;/font&gt;&lt;/strong&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;2&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Setting a parameter changes that to a &lt;strong&gt;K-Means clustering &lt;/strong&gt;implementation using the same framework&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;3+4&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Setting the same parameter another way, provides &lt;strong&gt;non-scalable&lt;/strong&gt; versions of the two clustering varieties.&amp;#160; (I know it's hard to swallow that the non-scalable versions count as separate algorithms, but if you &lt;em&gt;started&lt;/em&gt; with the vanilla versions and &lt;em&gt;added&lt;/em&gt; scalability, then &lt;em&gt;of course&lt;/em&gt; you would consider those versions as new algorithms - I'm just working backwards here.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;5&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Let's move to our Decision Tree algorithm and we will consider our classification tree as one algorithm.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;6&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;But our Decision Tree also predicts continuous and counts as a &lt;em&gt;regression&lt;/em&gt; tree, so we will count that as another algorithm.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;7&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Oops!&amp;#160; Our Decision Tree &lt;em&gt;also &lt;/em&gt;creates full linear regressions at each of the leaf nodes.&amp;#160; To get the typical regression tree behavior you need to make sure that none of the continuous inputs have the REGRESSOR flag and you get yet another algorithm.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;8&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Oh yeah, our trees allow for multiple targets in each model, allowing the discovery and display of interrelated patterns through our dependency net.&amp;#160; I've seen other vendors advertise such functionality as an &amp;quot;algorithm&amp;quot; so there's our #8.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;9&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;How about collaborative filtering with Trees - just slap a PREDICT flag on a nested table, and you have a complete recommendation system.&amp;#160; Let's call it Associative Trees&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;10&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Naive Bayes.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;11+12&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;If we're going to count Associative Trees, we also have &amp;quot;Associative Bayes&amp;quot;.&amp;#160; I guess the multiple target interrelated pattern thing counts here as well.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;13&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Association Rules.&amp;#160; A-priori style&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;14&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;It seems odd to count association rules twice since we can do predictions with it, but nobody else does it (or didn't before - correct me if I'm wrong), so Predictive Association Rules makes the cut.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;15+16+17+18&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Well if we're going to go and call predictive association an algorithm, we had better do the same for our clustering algorithm.&amp;#160; Granted, clustering doesn't make a great classifier or estimator, but the great Highlight Exceptions functionality of the Data Mining addins comes from this ability.&amp;#160; Yes, we can do nested table prediction as well with clustering, but I wouldn't recommend it to my mom, so I won't take another four for that.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;19+20+21+22+23&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;Neural Networks, Sequence Clustering, Time Series, Linear Regression and Logistic Regression.&amp;#160; Yeah, yeah, I could get into varieties here, but I think you get the point.&lt;/p&gt;  &lt;p&gt;&amp;#160;&lt;/p&gt;  &lt;p&gt;So by that count, and not being &lt;em&gt;too &lt;/em&gt;creative (trust me, I can do more) we're looking at &lt;font size="5"&gt;&lt;strong&gt;23 &lt;/strong&gt;&lt;/font&gt;algorithms in SQL Server 2005 Data Mining.&amp;#160; There are a few more options coming up in SQL Server 2008 that are worth discussing as well.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;24&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;The time series of SQL Server 2007 uses the ARTXP algorithm - &amp;quot;Auto Regression Trees with Cross Predict&amp;quot;.&amp;#160; In 2008, we're adding ARIMA as well, for algorithm #24.&lt;/p&gt;  &lt;p&gt;&lt;strong&gt;&lt;font size="5"&gt;25&lt;/font&gt;&lt;/strong&gt;&lt;/p&gt;  &lt;p&gt;And yet again with Time Series, the default mode of operation is to blend ARTXP and ARIMA results in an intelligent way to maximize accuracy and stability for #25.&lt;/p&gt;  &lt;p&gt;&amp;#160;&lt;/p&gt;  &lt;p&gt;Arbitrarily there are 23 algorithms in SQL 2005 and 25 in SQL 2008, with the option of teasing out even more varieties depending on how you apply parameters and flags to the base nine (or seven - depending on how you count!).&amp;#160;&amp;#160; Next time someone quips that SQL Server only has &amp;quot;nine&amp;quot; algorithms, tell them that's just the packaging - each of those nine provides a wealth of value in each box.&lt;/p&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=6410880" width="1" height="1"&gt;</description><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Decision+Trees/default.aspx">Decision Trees</category><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Clustering/default.aspx">Clustering</category><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Association+Rules/default.aspx">Association Rules</category><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Time+Series/default.aspx">Time Series</category><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Algorithms/default.aspx">Algorithms</category></item><item><title>New Time Series Features for SQL Server 2008</title><link>http://blogs.msdn.com/jamiemac/archive/2007/10/22/new-time-series-features-for-sql-server-2008.aspx</link><pubDate>Mon, 22 Oct 2007 18:46:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:5603870</guid><dc:creator>JamieMac</dc:creator><slash:comments>1</slash:comments><comments>http://blogs.msdn.com/jamiemac/comments/5603870.aspx</comments><wfw:commentRss>http://blogs.msdn.com/jamiemac/commentrss.aspx?PostID=5603870</wfw:commentRss><description>&lt;P&gt;The time series algorithm has had some major changes for SQL Server 2008.&amp;nbsp; We've ramped up the algorithm and added prediction against new data.&amp;nbsp; While the new data prediction is just as cool as the algorithm changes, I'll have to save that for later - this post I'll just tell you about the algorithm.&lt;/P&gt;
&lt;P&gt;As you may or may not know, the time series algorithm in SQL Server 2005 uses the ARTXP algorithm from Microsoft Research.&amp;nbsp; ARTXP stands for "Auto Regression Trees with Cross Predict" and of course, since you have to have an 'X' in any acronym worth its salt, "cross" is represented by an 'X'.&amp;nbsp; ARTXP uses similar regression trees as are found in our decision tree algorithm to predict future values based on past history, including the past history of other series.&amp;nbsp; It turns out that ARTXP, as verified through testing by Microsoft Research and the product team, is wickedly accurate at predicting the next step of a series - better than all other algorithms we've tried.&amp;nbsp; However, as you move away from the time horizon, depending on your data, the predictions can grow unstable fairly quickly.&amp;nbsp; Veteran users of the algorithm know how that's handled by the system - it agressively cuts off the prediction stream - i.e. it just stops.&lt;/P&gt;
&lt;P&gt;We heard some frustration from users that hit this, and knew we had to do something.&amp;nbsp; We didn't want to lose the accuracy or cross predictive ability of the ARTXP algorithm, but needed to control stability.&amp;nbsp; Additionally, we've had many requests for more "industry standard" algorithm implementations simply because they are well known (not because they are necessarily better).&amp;nbsp; So what did we do?&amp;nbsp; &lt;/P&gt;
&lt;P&gt;In SQL Server 2008 Data Mining, we have enhanced the Time Series algorithm to include not only an implementation of &lt;A class="" href="http://research.microsoft.com/~dmax/publications/dmart-final.pdf" mce_href="http://research.microsoft.com/~dmax/publications/dmart-final.pdf"&gt;ARTXP&lt;/A&gt;, but also an implementation of &lt;A class="" href="http://en.wikipedia.org/wiki/ARIMA" mce_href="http://en.wikipedia.org/wiki/ARIMA"&gt;ARIMA&lt;/A&gt; (Auto Regressive Integrated Moving Average).&amp;nbsp; The ARIMA algorithm is well-known and although all autoregressive algorithms have the potential for instability in long-term predictions, ARIMA tends to hold out for most data sets.&amp;nbsp; So, does this mean that you as the user have to decide between short-term accuracy and long term stabililty?&amp;nbsp; The answer is a resounding &lt;STRONG&gt;NO&lt;/STRONG&gt;!&amp;nbsp; The SQL Server 2008 Time Series algorithm by default builds &lt;EM&gt;both&lt;/EM&gt; an ARTXP model &lt;EM&gt;and&lt;/EM&gt; an ARIMA model.&amp;nbsp; For predictions, a weighted averaging scheme is used to favor the short term accuracy of ARTXP and the long term stability of ARIMA - essentially the best of both worlds!&lt;/P&gt;
&lt;P&gt;To control this new behavior we have add three new parameters:&lt;/P&gt;
&lt;P&gt;FORECAST_METHOD - controls which algorithms are used with MIXED being the default, but you can specify ARIMA or ARTXP as well.&lt;/P&gt;
&lt;P&gt;PREDICTION_SMOOTHING - controls the mixture of the ARTXP and ARIMA results.&amp;nbsp; Setting this value closer to 0 favors ARTXP more heavily, whereas setting it closer to 1 favors ARIMA more.&lt;/P&gt;
&lt;P&gt;INSTABILITY_SENSITIVITY - ok, this one has nothing to do with ARIMA, just your feedback on ARTXP.&amp;nbsp; If you specify ARTXP as the forecast method, you can now control the threshold at which the algorithm will cut off predictions.&amp;nbsp; Setting this to 0 will turn of instability checks altogether.&amp;nbsp; (By the way, with ARTXP if your regression formulae have coefficients that are all less than 1, you will never have a stability problem.&amp;nbsp; Stability issues only occur when there are coefficients greater than 1.&lt;/P&gt;
&lt;P&gt;If you want to try out the new Time Series algorithm, it is available in the July 2007 CTP (and later) of SQL Server 2008 which you can find&amp;nbsp;under &lt;A href="http://www.microsoft.com/sql/2008"&gt;www.microsoft.com/sql/2008&lt;/A&gt;.&amp;nbsp; In a later post (I know better than to specify when) I'll talk about the new prediction methods that you can apply to Time Series models, making these model reusable in a way never available before in SQL Server.&lt;/P&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=5603870" width="1" height="1"&gt;</description><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Time+Series/default.aspx">Time Series</category></item><item><title>Help with Time Series on OLAP - another great blog with SQL Server Data Mining</title><link>http://blogs.msdn.com/jamiemac/archive/2006/06/10/help-with-time-series-on-olap-another-great-blog-with-sql-server-data-mining.aspx</link><pubDate>Sat, 10 Jun 2006 21:22:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:625600</guid><dc:creator>JamieMac</dc:creator><slash:comments>0</slash:comments><comments>http://blogs.msdn.com/jamiemac/comments/625600.aspx</comments><wfw:commentRss>http://blogs.msdn.com/jamiemac/commentrss.aspx?PostID=625600</wfw:commentRss><description>&lt;FONT face=Verdana size=2&gt;&lt;A href="http://solidqualitylearning.com/blogs/dejan/"&gt;Dejan Sarka&lt;/A&gt; writes about how to get "&lt;/FONT&gt;&lt;A href="http://solidqualitylearning.com/blogs/dejan/archive/2006/01/27/1512.aspx"&gt;&lt;FONT face=Verdana size=2&gt;Cases from Multiple Dimensions of OLAP Cubes in the Time Series Algorithm&lt;/FONT&gt;&lt;/A&gt;&lt;FONT face=Verdana size=2&gt;" - an issue that has stymied many users.&amp;nbsp; He also has a range of great posts on other DM and BI topics as well - worth a good read!&lt;/FONT&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=625600" width="1" height="1"&gt;</description><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Analysis+Services/default.aspx">Analysis Services</category><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Time+Series/default.aspx">Time Series</category></item><item><title>Forecasting on the fly using Analysis Services Data Mining and Reporting Services</title><link>http://blogs.msdn.com/jamiemac/archive/2006/02/22/forecasting-on-the-fly-using-analysis-services-data-mining-and-reporting-services.aspx</link><pubDate>Thu, 23 Feb 2006 00:12:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:537262</guid><dc:creator>JamieMac</dc:creator><slash:comments>0</slash:comments><comments>http://blogs.msdn.com/jamiemac/comments/537262.aspx</comments><wfw:commentRss>http://blogs.msdn.com/jamiemac/commentrss.aspx?PostID=537262</wfw:commentRss><description>&lt;FONT face=Verdana size=2&gt;Just found this &lt;/FONT&gt;&lt;A href="http://www.microsoft.com/technet/prodtechnol/sql/2005/smartreports.mspx"&gt;&lt;FONT face=Verdana size=2&gt;great article on MSDN &lt;/FONT&gt;&lt;/A&gt;&lt;FONT face=Verdana size=2&gt;showing how to use session Time Series models in RS to forecast while generating a report.&amp;nbsp; Cool beans!&lt;/FONT&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=537262" width="1" height="1"&gt;</description><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Time+Series/default.aspx">Time Series</category><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Reporting+Services/default.aspx">Reporting Services</category></item><item><title>Time Series Prediction</title><link>http://blogs.msdn.com/jamiemac/archive/2005/03/28/time-series-prediction.aspx</link><pubDate>Tue, 29 Mar 2005 01:06:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:403137</guid><dc:creator>JamieMac</dc:creator><slash:comments>0</slash:comments><comments>http://blogs.msdn.com/jamiemac/comments/403137.aspx</comments><wfw:commentRss>http://blogs.msdn.com/jamiemac/commentrss.aspx?PostID=403137</wfw:commentRss><description>&lt;p&gt;&lt;font face="Verdana" size="2"&gt;Last week I was playing around with the Time Series algorithm - ok I was showing a customer - and I wanted to show the prediction language used to display the charts.&amp;nbsp; So I used the tools and showed them the basic prediction query for forecasting, but I wanted to go further and show them cool stats like the variance and standard deviation of each predicted value.&amp;nbsp; So I tried, and failed, and tried again, and failed, and after a few more furtive attempts had to admit to myself that I just didn't know (shame shame) how to get the standard deviation for a time series prediction.&lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font face="Verdana" size="2"&gt;But I didn't give up there - since you can see the deviations in the chart viewer, obviously you can get them from the server.&amp;nbsp; I fired up my handy-dandy SQL Profiler, connected to my Analysis Server and viola!&amp;nbsp; I pulled the query right out of the log!&amp;nbsp; Immediately afterwards I had one of those "oh yeah" moments where you realize that you knew (or should have guessed) all along but had a brain dead moment and simply spaced.&lt;/font&gt;&lt;/p&gt; &lt;p&gt;&lt;font face="Verdana" size="2"&gt;In any case, the syntax you need to use is not trivial and no one not on the development team is likely to guess out of thin air, so I wrote up this &lt;a href="http://www.sqlserverdatamining.com/DMCommunity/TipsNTricks/951.aspx"&gt;tip &lt;/a&gt;explaining the convoluted syntax for the world to see.&amp;nbsp; Once you see it, you won't likely forget it, and if you do - grab the profiler and puul it out, just like the dev team does!&lt;/font&gt;&lt;/p&gt;&lt;img src="http://blogs.msdn.com/aggbug.aspx?PostID=403137" width="1" height="1"&gt;</description><category domain="http://blogs.msdn.com/jamiemac/archive/tags/DMX/default.aspx">DMX</category><category domain="http://blogs.msdn.com/jamiemac/archive/tags/Time+Series/default.aspx">Time Series</category></item></channel></rss>