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.
Results diversification for keyword search on XML documents has attracted considerable attentions from research community in recent years. Though search results were diversified from different perspectives in the existing methods, the effects were still far away from satisfactory. This paper proposes a new way to
With the popularity of XML technology and Native XML database, efficiently indexing, and retrieving XML data in Native XML database become a important research topic. This paper proposes a keyword-based query solution for Native XML database. An inverted index for XML documents in Native XML database is constructed
A solution of a keyword query over graphs is a Group Steiner tree, which is rooted at a node and whose nodes collectively satisfy the query (e.g. node keywords cover all the query keywords), and in which the sum of edge weights satisfies given conditions (e.g., need to be minimum or be the first K minimal among all
As a practical and efficient technique to access XML data, keyword query approaches should address two main problems: enable users to express their query intentions accurately and provide matching algorithms to realize users' query intentions faithfully. Most of the existing researches concentrate on the second
There may exist a specific relationship between the keywords if an XML multi-keywords search has more than one answers. Such relationship can be speculated by SLCA. This paper proposes a user-friendly Top-k keywords searching approach based on the relationship of keywords. The SLCA of a keyword search is first
Nowadays, with the appearance of more and more web services, it has been one of the key points that how to find the target service quickly and precisely. Traditional methods of web service discovery are only based on the keyword matching, but it's very difficult to realize more detailed and intelligent services, and
answers, such as short-answer questions, discussion questions etc. There are two factors that will affect the subjective item scoring: knowledge point and the nearness level. The unidirectional nearness algorithm in the fuzzy mathematics only focus on the keyword matching, but ignore the scoring of the knowledge point and
the current Web in which information is given well-defined meaning, better enabling computers and people to work in cooperation. So this paper present a algorithm of Chinese text classification on semantic Web. After getting keywords from the Web text, we get rid of ambiguity of the keywords. Then we get the semantic
Because of ignoring the semantic information inside the keywords, the traditional searching engine based on the key words has low recall and precision. Aiming at this, some semantic retrieval system design ideas and the retrieval process are proposed in this paper.The key technologies-related in semantic retrieval
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.