turn on suggestions

Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.

Showing results for

Find a Community

- Home
- /
- Data Management
- /
- Forum
- /
- Minimum obs from dataset to cover all required lev...

Topic Options

- RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Printer Friendly Page

- Mark as New
- Bookmark
- Subscribe
- RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

10-28-2013 08:10 AM

I'm stumped.

I want to reduce a really big data-set to fewer observations, but containing all the levels of the original data-set (at most) once. This would be done for testing purposes, so it's in our best interest to come up with final data-set that has least number of obs.

So if we take data-set SASHELP.CLASS for example. I would like to find out the first obs (or any non-specific obs really, but i feel it might be easier with first/last obs) that covers each individual levels of the original data-set, **not** all possible (existing, or theoretical) combinations of the required variables.

Output would look something like this: (SASHELP.CLASS: all levels by AGE, SEX):

- AGE has 6 distinct levels (11-16)
- SEX has 2 distinct levels ("F", "M")
- Least number of obs covering those levels theoretically is 6.

So we should end up with:

- OBS #1: Affred, "M", 14
- OBS #2: Alice, "F", 13

*Barbara, Carol, and Henry will not be output, as both F-M and 13-14 are covered*

- OBS #3: James, "M", 12
- OBS #4: Janet, "F", 15
- OBS #5: Joyce, "F", 11
- OBS #6: Philip, "M", 16

*end of output*

In this case we went through data sequentially, and we've found minimum number of obs (6) satisfying the requirement, but if the levels get more lengthy (or inter-correlated), and data assorted (supposed we could pre-sort), we might end up with something that is close to minimum, but not quite minimum of longest level among required variables.

I would imagine this would require some sort of recursive algorithm to get most efficiently small number of obs to cover the values, but have no clue where to start. Any help will be greatly appreciated!

- Mark as New
- Bookmark
- Subscribe
- RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

Posted in reply to DannyT

10-28-2013 08:50 AM

This seems to work. You might replace the arrays with associative array so you don't have to guess at the dimension.

set sashelp.class;

array s[

array a[

fs = whichc(sex,of s

x+

s

fa= whichn(age,of a

y+

a

if not (fs and fa);

drop fs fa x y;

- Mark as New
- Bookmark
- Subscribe
- RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

Posted in reply to data_null__

10-28-2013 10:19 AM

Thanks for your reply, data_null_;

It may be because of v9.1.3 of SAS i'm running, but I seem to be getting the following error after "fs" and "fa" definitions:

ERROR: The ARRAYNAME

- Mark as New
- Bookmark
- Subscribe
- RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

Posted in reply to DannyT

10-28-2013 11:03 AM

remove _TEMPORARY_ and add retain

RETAIN s a;

and maybe drop s1-s3 a1-a10;