blob: 592f24900aced309fa0d869f8c7deb4d1623813d (
plain) (
blame)
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
package uk.ac.ox.cs.data.sample;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
import java.util.Stack;
import org.openrdf.rio.RDFHandlerException;
import org.openrdf.rio.turtle.TurtleWriter;
import uk.ac.ox.cs.pagoda.util.Utility;
public class RandomWalkMulti extends RandomWalk {
public RandomWalkMulti(RDFGraph graph, TurtleWriter writer) {
super(graph, writer);
}
Queue<Integer> queue = new LinkedList<Integer>();
@Override
public void sample() throws RDFHandlerException {
getStartNodes();
Utility.logInfo(queue.size());
int u, v, pick, index;
int individualLimit = statementLimit / queue.size(), currentLimit = 0;
RDFEdge edge;
List<RDFEdge> edges;
Stack<Integer> stack = new Stack<Integer>();
while (true) {
if (noOfStatements >= statementLimit) {
System.out.println("The number of statements in the sampling: " + noOfStatements);
return ;
}
if (noOfStatements >= currentLimit) {
stack.clear();
}
if (stack.isEmpty()) {
if (queue.isEmpty())
v = rand.nextInt(m_graph.numberOfIndividuals);
else {
v = queue.poll();
currentLimit += individualLimit;
}
stack.add(v);
// Utility.logInfo(noOfStart + " new start: " + m_graph.getRawString(v));
visit(v);
}
u = stack.peek();
if (rand.nextInt(100) < 15) {
stack.pop();
continue;
}
if ((edges = m_graph.edges.get(u)) == null || edges.size() == 0) {
stack.clear();
continue;
}
index = 0;
pick = rand.nextInt(edges.size());
for (Iterator<RDFEdge> iter = edges.iterator(); iter.hasNext(); ++index) {
edge = iter.next();
if (index == pick) {
stack.add(v = edge.m_dst);
visit(v);
m_writer.handleStatement(m_graph.getStatement(u, edge.m_label, edge.m_dst));
++noOfStatements;
iter.remove();
}
}
}
}
private void getStartNodes() throws RDFHandlerException {
Set<Integer> coveredConcepts = new HashSet<Integer>();
Integer concept;
Iterator<Integer> iter;
for (Map.Entry<Integer, LinkedList<Integer>> entry: m_graph.labels.entrySet()) {
iter = entry.getValue().iterator();
concept = null;
while (iter.hasNext()) {
if (!(coveredConcepts.contains(concept = iter.next()))) {
break;
}
else concept = null;
}
if (concept == null) continue;
else {
queue.add(entry.getKey());
coveredConcepts.add(concept);
while (iter.hasNext())
coveredConcepts.add(iter.next());
}
}
}
}
|
