Topic: most common value in a list (mode)

[hmspe]

I'm looking for a lisp function to find the mode of a list.  The list is numeric and represents distances between inserts in a drawing.  I'm having no luck finding anything useful.  Any help would be appreciated.  Online search is no help at all.

[ribarm]

What is mode of a list?

[JohnK]

Not quite sure I understand either but it sounds like you'd want to build a "Run Length Encoding" or something of that nature (something to count the instances of each entry) to find the highest number, next highest, lowest, etc.
https://www.theswamp.org/index.php?topic=57274.0#top

[hmspe]

The mode is the most common value in a list.  I don't recall ever hearing the term in any of my math classes, but my grandchildren know it well.

Thanks for the link. 

[ymg]

From https://www.investopedia.com/terms/m/mode.asp#:~:text=The%20mode%20in%20statistics%20refers,the%20numbers%20in%20the%20set.

The Bottom Line:
In statistics, the mode is the number that occurs most often. A data set can have one or more modes. The mode is different from the mean, which is the average of the numbers in a set; it's also different from the median, which is the midpoint of a set. Finding the mode in a set of numbers can tell you which data points occur most commonly, which can be useful information when analyzing statistics.


Just use count items by Lee Mac

Code: [Select]

;; Count Items  -  Lee Mac
;; Returns a list of dotted pairs detailing the number of
;; occurrences of each item in a supplied list.

(defun LM:CountItems ( l / c x )
    (if (setq x (car l))
        (progn
            (setq c (length l)
                  l (vl-remove x (cdr l))
            )
            (cons (cons x (- c (length l))) (LM:CountItems l))
        )
    )
)

Examples:

Code: [Select]

(LM:CountItems '("A" "B" "B" "B" "C" "C" "D" "E" "E" "E" "E"))
=>  (("A" . 1) ("B" . 3) ("C" . 2) ("D" . 1) ("E" . 4))


(LM:CountItems '(1 2 3 3 3 4 5 6 6 7 8 8 8 8))
=>  ((1 . 1) (2 . 1) (3 . 3) (4 . 1) (5 . 1) (6 . 2) (7 . 1) (8 . 4))


[rayakmal]

Welcome back, YMG.

Just use count items by Lee Mac

[hmspe]

I found an old function by John Uhden in the Autocad forums and modified it slightly.  I changed a couple of single character variables to meaningful names and I return a value instead of a list containing all the instances of the most common value. 

Code - Auto/Visual Lisp: [Select]

1. (defun @mode (lst fuzz / index count item items mode)
2.   (setq index 0
3.         count 0
4.   )
5.   (repeat (length lst)
6.     (setq item (nth index lst)
7.           items (vl-remove-if-not '(lambda (x)(equal x item fuzz)) lst)
8.           index (1+ index)
9.     )
10.     (if (> (length items) count)
11.       (setq count (length items) mode items)
12.     )
13.   )
14.   (car mode)
15. )
16.  

Test:

Code - Auto/Visual Lisp: [Select]

1. (defun c:tx ()
2.   (setq l (list 1.0 5.6 9.3.5 6.6 3 4 8 7 6 2 1 3 5 4 56 8 45 123 545 1 235 15 35 135 1 5 6 7 8 9.3 9.3 9.3 9.3 9.3 9.3 9.3 9.3 9.3 5 1 2 2))
3.   (print (@mode l  0.01))
4.   (princ)
5. )
6.  

Returns:
9.3

Thanks for the suggestions.

[JohnK]

Sorry, no time to look at code but what happens in the following situation?

11, 11, 33, 33, 54

Should be: (11, 33)

[hmspe]

Sorry, no time to look at code but what happens in the following situation?

11, 11, 33, 33, 54

Should be: (11, 33)

My most recent post will return 11.  My understanding is that the mode would be undefined for your data set because there is not a single number with the highest count in the data set. 

I'm working with distances between adjacent points in an x,y array that come from an ssget operation.  My data set will always have only one most common value.

[Lee Mac]

Since you're already shortening the list using vl-remove-if with each iteration, it's more efficient to iterate until the list is exhausted rather than using a fixed iteration over the entire original list, e.g.:

Code - Auto/Visual Lisp: [Select]

1. (defun mode ( lst fuz / cnt dif itm len rtn )
2.     (while lst
3.         (setq len (length lst)
4.               itm (car lst)
5.               lst (vl-remove-if '(lambda ( x ) (equal itm x fuz)) (cdr lst))
6.               dif (- len (length lst))
7.         )
8.         (if (< cnt dif)
9.             (setq cnt dif rtn itm)
10.         )
11.     )
12.     rtn
13. )

Code - Auto/Visual Lisp: [Select]

1. Benchmarking .............Elapsed milliseconds / relative speed for 1024 iteration(s):
2.  
3.     (MODE L 0.01)......1782 / 2.49 <fastest>
4.     (@MODE L 0.01).....4437 / 1.00 <slowest>

[hmspe]

Thanks, Lee.