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.
process in which groups of semantically similar queries are identified. An efficient clustering algorithm called suffix tree clustering is developed in the study. Meanwhile, the keyword- based similarity measure is used for determining the closest cluster to the given query, and the Chinese synonymy is also considered in the
the document tags is considered as cluster name. Thus in short, web search results that are fetched from the prevailing web search engines grouped under phrases that contain one or more search keywords. This paper aims at organizing web search results into clusters facilitating quick browsing options to the browser
To get semantic related searching results based on simple keywords, XML search engine not only need to search the matched nodes but also need to check whether those matched nodes are semantic related nodes in XML tree. Since the judgment on the semantic related nodes might cost much time, we first use mining
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.