The starting point for your SAS® and Viya™ projects
Discover technical articles from the community
Snippets & Tutorials
FAQ & Help
Business Use Cases
Full Catalog & Examples
Preparation Scripts
SAS & Python Integration
News, tech watch and site updates
Participate in the life of the site
The logisticCode action writes SAS DATA step code that can be used to compute pr...
The listQKBs action lists all Quality Knowledge Bases (QKBs) that are available ...
The crossTab action performs one-way or two-way tabulations, also known as frequ...
You can use the 'limitN' parameter to specify a nominal sample size for control limits. To include all subgroups regardless of their size, set 'allN' to True. To enable tests for special causes with varying subgroup sizes, set 'testNStd' to True.
The Louvain algorithm is a heuristic method for community detection. It iteratively optimizes modularity, a metric that measures the density of links inside communities as compared to links between communities. It involves two phases: first, finding small communities by optimizing modularity locally, and second, building a new network whose nodes are the communities from the first phase.
specifies the input table containing vertices information. For more information about specifying the verticesIn parameter, see the common castable parameter.
Specifies an expression for subsetting the input data.
specifies that the layout is initially determined without vertices with high degree, i.e. vertices with degree at least highdegree= times the number of vertices in the graph. Default: 0.75. Range: 0–1.