DocumentCode :
3225283
Title :
Term co-occurrence-based corpus network
Author :
Park, Jung-Hee ; Kim, Jeong-Hyun ; Park, Sang-Bae ; Lee, Sang-Jo
Author_Institution :
Dept. of Comput. Eng., Kyungpook Nat. Univ., Daegu, South Korea
Volume :
3
fYear :
2004
fDate :
2-6 Nov. 2004
Firstpage :
2957
Abstract :
This paper draws the term nodes and their links in corpus network based on term co-occurrence, and resultantly grasps its properties, using the mathematical graphs and the network-related physical measures. The topological processing of singular value decomposition (SVD), which compresses a large amount of co-occurrence information into a much smaller space, is similar to the common feature of feed-forward neural network systems where a large number of inputs are connected to a fairly small number of hidden layer nodes. Until now, the diagonal values by SVD have not been interpreted in full and the statistical step of hidden nodes depends only on the input. It is supposed that this study will provide the visual clues, which were described in the corpus, of the contraction-expansion homeostasis of the corpus network, and will help for actualizing the ambiguous axis in a space generated by SVD and characterizing the more efficient input-dependant steps of hidden nodes.
Keywords :
feedforward neural nets; graph theory; singular value decomposition; SVD; co-occurrence; contraction-expansion homeostasis; corpus network; diagonal value; feed-forward neural network; hidden layer node; mathematical graph; singular value decomposition; topological processing; Art; Character generation; Computer networks; Feedforward neural networks; Feedforward systems; Frequency; Information retrieval; Neural networks; Physics computing; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Industrial Electronics Society, 2004. IECON 2004. 30th Annual Conference of IEEE
Print_ISBN :
0-7803-8730-9
Type :
conf
DOI :
10.1109/IECON.2004.1432281
Filename :
1432281
Link To Document :
بازگشت