• 제목/요약/키워드: String Vectors

검색결과 18건 처리시간 0.022초

Representation of Texts into String Vectors for Text Categorization

  • Jo, Tae-Ho
    • Journal of Computing Science and Engineering
    • /
    • 제4권2호
    • /
    • pp.110-127
    • /
    • 2010
  • In this study, we propose a method for encoding documents into string vectors, instead of numerical vectors. A traditional approach to text categorization usually requires encoding documents into numerical vectors. The usual method of encoding documents therefore causes two main problems: huge dimensionality and sparse distribution. In this study, we modify or create machine learning-based approaches to text categorization, where string vectors are received as input vectors, instead of numerical vectors. As a result, we can improve text categorization performance by avoiding these two problems.

Modified Version of SVM for Text Categorization

  • Jo, Tae-Ho
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제8권1호
    • /
    • pp.52-60
    • /
    • 2008
  • This research proposes a new strategy where documents are encoded into string vectors for text categorization and modified versions of SVM to be adaptable to string vectors. Traditionally, when the traditional version of SVM is used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text categorization, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and apply the modified version of SVM adaptable to string vectors for text categorization.

Inverted Index based Modified Version of K-Means Algorithm for Text Clustering

  • Jo, Tae-Ho
    • Journal of Information Processing Systems
    • /
    • 제4권2호
    • /
    • pp.67-76
    • /
    • 2008
  • This research proposes a new strategy where documents are encoded into string vectors and modified version of k means algorithm to be adaptable to string vectors for text clustering. Traditionally, when k means algorithm is used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text clustering, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and modify the k means algorithm adaptable to string vectors for text clustering.

Inverted Index based Modified Version of KNN for Text Categorization

  • Jo, Tae-Ho
    • Journal of Information Processing Systems
    • /
    • 제4권1호
    • /
    • pp.17-26
    • /
    • 2008
  • This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Traditionally, when KNN are used for pattern classification, raw data should be encoded into numerical vectors. This encoding may be difficult, depending on a given application area of pattern classification. For example, in text categorization, encoding full texts given as raw data into numerical vectors leads to two main problems: huge dimensionality and sparse distribution. In this research, we encode full texts into string vectors, and modify the supervised learning algorithms adaptable to string vectors for text categorization.

스트링과 수정된 SOFM을 이용한 이동로봇의 전역 경로계획 (Global Path Planning of Mobile Robot Using String and Modified SOFM)

  • 차영엽
    • 한국정밀공학회지
    • /
    • 제25권4호
    • /
    • pp.69-76
    • /
    • 2008
  • The self-organizing feature map(SOFM) among a number of neural network uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector. On the other hand, the modified method in this research uses a predetermined initial weight vectors of the 1-dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward the opposite direction of input vector. According to simulation results one can conclude that the method using string and the modified neural network is useful tool to mobile robot for the global path planning.

이동로봇의 전역경로계획을 위한 단경로 String에서 당기기와 밀어내기 SOFM을 이용한 방법의 비교 (The Comparison of Pulled and Pushed-SOFM in Single String for Global Path Planning of Mobile Robot)

  • 차영엽
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2008년도 추계학술대회A
    • /
    • pp.900-901
    • /
    • 2008
  • In this research uses a predetermined initial weight vectors of 1-dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are moved toward or reverse the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.

  • PDF

전역경로계획을 위한 단경로 스트링에서 당기기와 밀어내기 SOFM을 이용한 방법의 비교 (The Comparison of Pulled- and Pushed-SOFM in Single String for Global Path Planning)

  • 차영엽;김곤우
    • 제어로봇시스템학회논문지
    • /
    • 제15권4호
    • /
    • pp.451-455
    • /
    • 2009
  • This paper provides a comparison of global path planning method in single string by using pulled and pushed SOFM (Self-Organizing Feature Map) which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial-weight-vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified SOFM method in this research uses a predetermined initial weight vectors of the one dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward or reverse the input vector, by rising a pulled- or a pushed-SOFM. According to simulation results one can conclude that the modified neural networks in single string are useful tool for the global path planning problem of a mobile robot. In comparison of the number of iteration for converging to the solution the pushed-SOFM is more useful than the pulled-SOFM in global path planning for mobile robot.

Theoretical and experimental study on damage detection for beam string structure

  • He, Haoxiang;Yan, Weiming;Zhang, Ailin
    • Smart Structures and Systems
    • /
    • 제12권3_4호
    • /
    • pp.327-344
    • /
    • 2013
  • Beam string structure (BSS) is introduced as a new type of hybrid prestressed string structures. The composition and mechanics features of BSS are discussed. The main principles of wavelet packet transform (WPT), principal component analysis (PCA) and support vector machine (SVM) have been reviewed. WPT is applied to the structural response signals, and feature vectors are obtained by feature extraction and PCA. The feature vectors are used for training and classification as the inputs of the support vector machine. The method is used to a single one-way arched beam string structure for damage detection. The cable prestress loss and web members damage experiment for a beam string structure is carried through. Different prestressing forces are applied on the cable to simulate cable prestress loss, the prestressing forces are calculated by the frequencies which are solved by Fourier transform or wavelet transform under impulse excitation. Test results verify this method is accurate and convenient. The damage cases of web members on the beam are tested to validate the efficiency of the method presented in this study. Wavelet packet decomposition is applied to the structural response signals under ambient vibration, feature vectors are obtained by feature extraction method. The feature vectors are used for training and classification as the inputs of the support vector machine. The structural damage position and degree can be identified and classified, and the test result is highly accurate especially combined with principle component analysis.

화자 적응을 이용한 대용량 음성 다이얼링 (Large Scale Voice Dialling using Speaker Adaptation)

  • 김원구
    • 제어로봇시스템학회논문지
    • /
    • 제16권4호
    • /
    • pp.335-338
    • /
    • 2010
  • A new method that improves the performance of large scale voice dialling system is presented using speaker adaptation. Since SI (Speaker Independent) based speech recognition system with phoneme HMM uses only the phoneme string of the input sentence, the storage space could be reduced greatly. However, the performance of the system is worse than that of the speaker dependent system due to the mismatch between the input utterance and the SI models. A new method that estimates the phonetic string and adaptation vectors iteratively is presented to reduce the mismatch between the training utterances and a set of SI models using speaker adaptation techniques. For speaker adaptation the stochastic matching methods are used to estimate the adaptation vectors. The experiments performed over actual telephone line shows that proposed method shows better performance as compared to the conventional method. with the SI phonetic recognizer.

이동로봇의 전역 경로계획을 위한 Self-organizing Feature Map (Self-organizing Feature Map for Global Path Planning of Mobile Robot)

  • 정세미;차영엽
    • 한국정밀공학회지
    • /
    • 제23권3호
    • /
    • pp.94-101
    • /
    • 2006
  • A global path planning method using self-organizing feature map which is a method among a number of neural network is presented. The self-organizing feature map uses a randomized small valued initial weight vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector On the other hand, the modified method in this research uses a predetermined initial weight vectors of 1-dimensional string and 2-dimensional mesh, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are moved toward the input vector. According to simulation results one can conclude that the modified neural network is useful tool for the global path planning problem of a mobile robot.