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.
Inferring Bloom's Taxonomy among knowledge units is important and challenging. This paper proposes a novel method that can identify the revised Bloom's Taxonomy levels among knowledge units in the semantic cognitive graph (SCG) by using a graph triangularity. The method determines significant relationships among knowledge units by utilizing triangularity of knowledge units in the computer science...
Semantic analysis among knowledge units in the text is a very interesting problem in numerous applications. Beside the semantic relationships expressed in the text, relationships are also encoded in knowledge structures in our brains. However, the relationships among knowledge units are highly sophisticated and require a human judgment. In this paper, we propose a Graph-Tringluarity-based system for...
With the development of social media applications, short text mining is becoming more and more important. Due to the sparseness of short text data, both the feature correlation information (word co-occurrence) and data contiguity information (context information) are less reliable, thus most existing text mining methods which are designed to address regular text data are less efficient in short text...
Most of the exist Web search engines utilize matching the query keywords to pieces of information approach to identify of the data satisfying user's request. These methods are not only inefficient, but also wasted a lot of user's time to find a satisfactory results. In order to improve the problem above, we presented a different approach to identify user's request that attracts more interest is called...
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.