Semantic Suffix Net Clustering for Search Results
نویسندگان
چکیده
منابع مشابه
Semantic Suffix Net Clustering for Search Results
Suffix Tree Clustering (STC) uses the suffix tree structure to find a set of snippets that share a common phrase and uses this information to propose clusters. As a result, STC is a fast incremental algorithm for automatic clustering and labeling but it cannot cluster semantically similar snippets. However, the meaning of the words is indeed an important property that relates them to other word...
متن کاملSemantic Suffix Tree Clustering
This paper proposes a new algorithm, called Semantic Suffix Tree Clustering (SSTC), to cluster web search results containing semantic similarities. The distinctive methodology of the SSTC algorithm is that it simultaneously constructs the semantic suffix tree through an on-depth and on-breadth pass by using semantic similarity and string matching. The semantic similarity is derived from the Wor...
متن کاملImproving Web Search Results Using Semantic Clustering
This paper consider the problem of search engine that are not capable of retrieving appropriate result on query given. Most of the users are not able to give the appropriate query to get what exactly they wanted to retrieve. So the search engine retrieves a massive list of data, which are ranked by the page rank algorithm or relevancy algorithm or human judgment algorithm. If the relevant resul...
متن کاملSemantic Clustering of Search Engine Results
This paper presents a novel approach for search engine results clustering that relies on the semantics of the retrieved documents rather than the terms in those documents. The proposed approach takes into consideration both lexical and semantics similarities among documents and applies activation spreading technique in order to generate semantically meaningful clusters. This approach allows doc...
متن کاملClustering of Web Search Results Using Semantic
Clustering is related to data mining for information retrieval. Relevant information is retrieved quickly while doing the clustering of documents. It organizes the documents into groups; each group contains the documents of similar type content. Different clustering algorithms are used for clustering the documents such as partitioned clustering (K-means Clustering) and Hierarchical Clustering (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/9557-4017