2017-05-03 52 views
0

我一直在努力解決這個寵物問題一段時間,所以任何幫助將不勝感激!LSTM Tensorflow模型不考慮序列

我有一個csv文件,有幾個隨機列,最後一列是基於第一列最後幾個值的總和。我試圖用一個LSTM模型來捕獲這個結構,即預測前幾列中的最後一列。

這是我一直在使用該型號:

# Generate test data 

train_input = train_input.reshape(m, n_input, 1) # is nr of rows, n_input is number of input columns 

NUM_EXAMPLES = int(m * training_size) 

test_input = train_input[NUM_EXAMPLES:] 
test_output = train_output[NUM_EXAMPLES:] 

train_input = train_input[:NUM_EXAMPLES] 
train_output = train_output[:NUM_EXAMPLES] 
# 
# # Design model 
# 
data = tf.placeholder(tf.float32, [None, n_input, 1]) 
target = tf.placeholder(tf.float32, [None, n_classes]) 

num_hidden = 24 
cell = tf.contrib.rnn.LSTMCell(num_hidden, state_is_tuple=True) 

val, state = tf.nn.dynamic_rnn(cell, data, dtype=tf.float32) 

val = tf.transpose(val, [1, 0, 2]) 
last = tf.gather(val, int(val.get_shape()[0]) - 1) 

weight = tf.Variable(tf.truncated_normal([num_hidden, int(target.get_shape()[1])])) 
bias = tf.Variable(tf.constant(0.1, shape=[target.get_shape()[1]])) 

prediction = tf.nn.softmax(tf.matmul(last, weight) + bias) 

cross_entropy = -tf.reduce_sum(target * tf.log(tf.clip_by_value(prediction,1e-10,1.0))) 

optimizer = tf.train.AdamOptimizer() 
minimize = optimizer.minimize(cross_entropy) 

mistakes = tf.not_equal(tf.argmax(target, 1), tf.argmax(prediction, 1)) 
error = tf.reduce_mean(tf.cast(mistakes, tf.float32)) 

init_op = tf.global_variables_initializer() 
sess = tf.Session() 
sess.run(init_op) 

no_of_batches = int(len(train_input)/batch_size) 
for i in range(epoch): 
    ptr = 0 
    for j in range(no_of_batches): 
     inp, out = train_input[ptr:ptr+batch_size], train_output[ptr:ptr+batch_size] 
     ptr+=batch_size 
     sess.run(minimize,{data: inp, target: out}) 
    print("Epoch - {}".format(i)) 
incorrect = sess.run(error,{data: test_input, target: test_output}) 
print('Epoch {:2d} error {:3.1f}%'.format(i + 1, 100 * incorrect)) 
sess.close() 

我試過幾個電子表格與隨機數,而且我一直獲得約83%的錯誤率。另一方面,該算法可以瞭解目標列是否不連續。

在此先感謝!

回答

0

我不明白你的觀點,你的意思是你有這樣的csv文件嗎?

x1 x2 x3 x4 ... xn 
v11 v21 v31 v41 ... vn1 
v12 v22 v32 v42 ... vn2 
... 
v1n v2n v3n v4n ... vnn 
y1 y2 y3 y4 ... yn 

而且yn基於sum(vn1+...+vnn)?像a * sum(V) + b

+0

對於最近的答案,yn完全基於x1列中的最後5個條目。 yn中的前四個條目是0,之後是yn = x1(n-5)+ x1(n-4)... + x1n – Akubara