Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Data mining, data warehousing and k... by sam2sung2 639 views
- Graph mining 2: Statistical approac... by tuxette 289 views
- hierarchical clustering final by Ashmi Banerjee 398 views
- lecture:Operating Syste Ms by yeswanth reddy 1254 views
- 70-272 Chapter03 by Gene Carboni 472 views
- 3. mining frequent patterns by Azad public school 447 views

3,431 views

Published on

MS SQL SERVER: Microsoft sequence clustering and association rules

Published in:
Technology

No Downloads

Total views

3,431

On SlideShare

0

From Embeds

0

Number of Embeds

11

Shares

0

Downloads

0

Comments

0

Likes

3

No embeds

No notes for slide

- 1. Microsoft Sequence ClusteringAnd Association Rules<br />
- 2. OVERVIEW<br />Introduction<br />DMX Queries<br />Interpreting the sequence clustering model<br />Microsoft Sequence Clustering Algorithm Principles and Parameters<br />Markov chain model<br />Introduction to Microsoft Association Rules<br />Association Algorithm Principles and Parameters<br />
- 3. Microsoft Sequence ClusteringAnd Association Rules<br />The Microsoft Sequence Clustering algorithm is a sequence analysis algorithm provided by Microsoft SQL Server Analysis Services.<br />The algorithm finds the most common sequences by grouping, or clustering, sequences that are identical.<br />Ex : Data that describes the click paths that are created when users navigate or browse a Web site.<br />Data that describes the order in which a customer adds items to a shopping cart at an online retailer.<br />
- 4. DMX Queries<br />By querying the data mining schema rowset, you can<br />find various kinds of information about the model such as:<br />Basic metadata, <br />The date and time that the model was created and last processed, <br />The name of the mining structure that the model is based on, <br />The column used as the predictable attribute.<br />
- 5. DMX Queries<br />SELECT MINING_PARAMETERS <br />from <br />$system.DMSCHEMA_MINING_MODELS WHERE MODEL_NAME = 'Sequence Clustering'<br /> Query to return the parameters that were used to build and train the Sample model.<br />
- 6. DMX Queries<br />SELECT FLATTENED NODE_UNIQUE_NAME, (SELECT ATTRIBUTE_VALUE AS [Product 1], [Support] AS [Sequence Support], [Probability] AS [Sequence Probability] <br /> FROM NODE_DISTRIBUTION) AS t FROM [Sequence Clustering].CONTENT WHERE NODE_TYPE = 13 AND [PARENT_UNIQUE_NAME] = 0<br />Getting a List of Sequences for a State<br />Query to return the complete list of first states in the model, before the sequences are grouped into clusters. <br />Returning the list of sequences (NODE_TYPE = 13) that have the model root node as parent (PARENT_UNIQUE_NAME = 0). <br />The FLATTENED keyword makes the results easier to read.<br />Sample result of this query is shown in the next figure.<br />
- 7. DMX Queries<br />you reference the value returned for NODE_UNIQUE_NAME to get the ID of the node that contains all sequences for the model.<br /> You pass this value to the query as the ID of the parent node, to get only the transitions included in this node, which happens to contain a list of al sequences for the model. <br />
- 8. Interpreting the sequence clustering model<br />A sequence clustering model has a single parent node that represents the model and its metadata. <br />The parent node, which is labeled, has a related sequence node that lists all the transitions that were detected in the training data.<br />The algorithm also creates a number of clusters, based on the transitions that were found in the data and any other input attributes included when creating the model. <br />Each cluster contains its own sequence node that lists only the transitions that were used in generating that specific cluster. <br />
- 9. Interpreting the sequence clustering model<br />
- 10. Microsoft Sequence Clustering Algorithm Principles<br />The Microsoft Sequence Clustering algorithm is a hybrid algorithm that combines clustering techniques with Markov chain analysis to identify clusters and their sequences.<br />This data typically represents a series of events or transitions between states in a dataset. <br />The algorithm examines all transition probabilities and measures the differences, or distances, between all the possible sequences in the dataset to determine which sequences are the best to use as inputs for clustering. <br />After the algorithm has created the list of candidate sequences, it uses the sequence information as an input for the EM method of clustering.<br />
- 11. Markov chain model<br />A Markov chain also contains a matrix of transition probabilities. <br />The transitions emanating from a given state define a distribution over the possible next states. <br />The equation P (xi= G|xi-1=A) = 0.15 means that, given the current state A, the probability of the next state being G is 0.15.<br />
- 12. Markov chain model<br />Based on the Markov chain, for any given length L sequence x {x1, x2,x3,. . .,xL}, <br />you can calculate the probability of a sequence as follows:<br />P(x) = P(xL . xL-1,. . .,x1)<br /> = P(xL| xL-1,. . .,x1)P (xL-1|xL-2,. . .,x1).. .P(x1)<br />In first-order, the probability of each state xi depends only on the state of xi-1.<br />P(x) = P(xL . xL-1,. . .,x1)<br /> = P(xL|xL-1)P(xL-1|xL-2). . .P(x2|x1)P(x1)<br />
- 13. Microsoft Sequence Clustering Parameters<br /><ul><li>CLUSTER_COUNTspecifies the approximate number of clusters to be built by the algorithm. </li></ul>Setting the CLUSTER_COUNT parameter to 0 causes the algorithm to use heuristics to best determine the number of clusters to build.<br />The default is 10.<br /><ul><li>MAXIMUM_STATESspecifies the maximum number of states for a non-sequence attribute that the algorithm supports. </li></ul>The default is 100.<br />
- 14. Microsoft Sequence Clustering Parameters<br /><ul><li>MINIMUM_SUPPORTspecifies the minimum number of cases that is required in support of an attribute to create a cluster.</li></ul>The default is 10.<br /><ul><li>MAXIMUM_SEQUENCE_STATES specifies the maximum number of states that a sequence can have.</li></ul>The default is 64.<br />
- 15. Introduction to Microsoft Association Rules<br />The Microsoft Association Rules Viewer in Microsoft SQL Server Analysis Services displays mining models that are built with the Microsoft Association algorithm.<br />The Microsoft Association algorithm is an association algorithm provided by Analysis Services that is useful for recommendation engines. <br />A recommendation engine recommends products to customers based on items they have already bought, or in which they have indicated an interest. <br />The Microsoft Association algorithm is also useful for market basket analysis.<br />
- 16. Structure of an Association Model<br />The top level has a single node (Model Root) that represents the model. <br />The second level contains nodes that represent qualified item sets and rules.<br />
- 17. Association Algorithm Principles<br />The Microsoft Association Rules algorithm belongs to the Apriori association family. <br />The two steps in the Microsoft Association Rules algorithm are:<br /><ul><li>calculation-intensive phase, is to find frequent item sets.
- 18. Generate association rules based on frequent item sets. </li></li></ul><li>Association Algorithm Parameters<br />MINIMUM_SUPPORT is the minimum support found for a frequent itemset.<br />Its value is within the range of 0 to 1.<br />MAXIMUM_SUPPORT is the maximum support found for a frequent itemset.<br />Its value is within the range of 0 to 1. <br />The default value is 0.03.<br />
- 19. Association Algorithm Parameters<br />MINIMUM_PROBABILITY is a threshold parameter. <br />It defines the minimum probability for an association rule. <br />Its value is within the range of 0 to 1. <br />The default value is 0.4.<br />MINIMUM_IMPORTANCE is a threshold parameter for association rules.<br /> Rules with importance less than Minimum_Importance are filtered out.<br />
- 20. Association Algorithm Parameters<br />MAXIMUM_ITEMSET_SIZE specifies the maximum size of an itemset. <br />The default value is 0, which means that there is no size limit on the itemset.<br />MINIMUM_ITEMSET_SIZE specifies the minimum size of the itemset. <br />The default value is 0.<br />MAXIMUM_ITEMSET_COUNTdefines the maximum number of item sets.<br />
- 21. Association Algorithm Parameters<br />OPTIMIZED_PREDICTION_COUNTdefines the number of items to be cached to optimized predictions<br />AUTODETECT_MINIMUM_SUPPORTrepresents the sensitivity of the algorithm used to autodetect minimum support.<br />To automatically detect the smallest appropriate value of minimum support, Set this value to 1.0 .<br />To turns off autodetection, Set this value to 1.0 <br />
- 22. Summary<br />Introduction to sequence clustering<br />DMX Queries<br />The sequence clustering model<br />Microsoft Sequence Clustering Algorithm Principles and Parameters<br />Markov chain model<br />Introduction to Microsoft Association Rules<br />Association Algorithm Principles and Parameters<br />
- 23. Visit more self help tutorials<br />Pick a tutorial of your choice and browse through it at your own pace.<br />The tutorials section is free, self-guiding and will not involve any additional support.<br />Visit us at www.dataminingtools.net<br />

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment