FilesExpand file tree

master

/

DataSetShuffler.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

67 lines (49 loc) · 1.59 KB

master

/

DataSetShuffler.java

Copy path

Top

File metadata and controls

• Code
• Blame

67 lines (49 loc) · 1.59 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

package utils;

import datastructs.interfaces.I2DDataSet;

import datastructs.interfaces.IVector;

import java.util.HashSet;

import java.util.Random;

import java.util.Set;

public class DataSetShuffler {

public static void shuffle(I2DDataSet dataSet){

int min = 0;

int max = dataSet.m();

Random random = new Random();

Set<Integer> touched = new HashSet<>();

for(int r=0; r<max; ++r){

if(touched.contains(r)){

continue;

}

int candidate = random.nextInt((max - min) + 1) + min;

if(touched.contains(candidate)){

continue;

}

// exchange

dataSet.excahngeRows(r , candidate);

touched.add(r);

touched.add(candidate);

}

}

public static void shuffle(I2DDataSet dataSet, IVector labels){

if(dataSet.m() != labels.size()){

throw new IllegalArgumentException("Cannot shuffle sets of different size");

}

int min = 0;

int max = labels.size();

Random random = new Random();

Set<Integer> touched = new HashSet<>();

for (int i = 0; i < labels.size(); i++) {

if(touched.contains(i)){

continue;

}

int candidate = random.nextInt((max - min) + 1) + min;

if(touched.contains(candidate)){

continue;

}

dataSet.excahngeRows(i , candidate);

labels.excahnge(i, candidate);

touched.add(i);

touched.add(candidate);

}

}

}