Re^4: Data compression by 50% + : is it possible?

BrowserUk:

There are remarkably fewer combinations than it would appear at first glance. The OP creates a vector of four random digits (0..9), but then enforces a few rules:

The four digits are sorted: This reduces 10,000 input vectors to 715 possible outputs.
Then the code eliminates duplicate values and sequential values reducing the 715 inputs to 102 outputs.
Then the first value is removed from the list reducing the possible outputs to 50.

As a result of those rules, none of the output groups will contain 0 or 1. So with the OPs script, you should never see the characters:

$ perl -e 'print join(" ", map { chr(33+$_), chr(33+$_+1) } map {10*$_
+} 0 .. 8)'
! " + , 5 6 ? @ I J S T ] ^ g h q r
[download]

That removes 18 of the 90 values, greatly reducing the number of possible records generated. Additionally, the remaining digits aren't equally distributed: 2 appears about half as often as 3 and about a third as often as 9.

...roboticus

When your only tool is a hammer, all problems look like your thumb.

Comment on Re^4: Data compression by 50% + : is it possible? Download Code

Replies are listed 'Best First'.
Re^5: Data compression by 50% + : is it possible? by BrowserUk (Patriarch) on May 12, 2019 at 23:33 UTC
So with the OPs script, ... that removes 18 of the 90 values, And do you think that is his intent, or just clumsy coding? Has he said? Additionally, the remaining digits aren't equally distributed: 2 appears about half as often as 3 and about a third as often as 9. Again, is that a carefully designed intent, or just a badly coded demo thrown together for posting? Is true regardless of whether he uses the same PRNG as you tested? Didn't he say preserving order was a goal, even if not a requirement? With does he mean the order before or after that sort in the demo code? Even if the reduction to 72 values, is intended, you still get ( 1 - 6.16992500144231 / 8 ) *100 = 22.875937481971125% best possible saving. If you take his description as the 'spec', as I did, -- rather then the output of a few trials of his code on a given machine/PRNG as you have -- the answer to his title question: "Data compression by 50% + : is it possible?", is: no. With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday' Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. "Science is about questioning the status quo. Questioning authority". The enemy of (IT) success is complexity. In the absence of evidence, opinion is indistinguishable from prejudice. Suck that fhit	[reply]
Re^6: Data compression by 50% + : is it possible? by baxy77bax (Deacon) on May 13, 2019 at 08:53 UTC
Just to make it clear, there is no clumsy coding. Clumsy wording maybe, but no coding. That is why i posted the code instead trying to describe it. But I do understand the point you are trying to convey. Thnx!	[reply]


Pathologically Eclectic Rubbish Lister
	PerlMonks