The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The complex network theory is widely used in the field of keyword extraction. Through analyzing the insufficient of keyword extraction algorithms using traditional complex network, this paper proposes a new method to extract Chinese keyword based on semantically weighted network. On the basis of K-nearest neighbor
information is deficient and noisy on YouTube. In this paper, we propose the novel dual updating method for YouTube video topic discovery. We first enhance the document representation for each video with its related videos, then we extract meaningful topics via keyword cores, at last, the video response links and the
This article proposes such a question classification approach that integrates multiple semantic features. It is aimed at these two questions in Chinese question classification models: inaccurate semantic information extraction and too slow processing speed caused by too high Eigenvector dimension. With the help of HowNet and the support vector machine and syntactic and semantic information of question...
to keeping the original idea in TWSVM, still the edges of our method lie in considerably less computing time with respect to TWSVM, which is comparable to that of GEPSVM. Experiments tried out on standard datasets disclose the effectiveness of our method. Keywords: TWSVM; dual QPPs; approximate.
With rapid development of Internet information, It is quite an important project for data mining that how to classify these large amounts of texts. In this paper, we propose an improved text classify cluster algorithm, while calculating similarity, we synthetically consider the relationship between keywords and
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.