2012
DOI: 10.5120/6342-8633
|View full text |Cite
|
Sign up to set email alerts
|

Web Search Result Clustering using Heuristic Search and Latent Semantic Indexing

Abstract: Giving user a simple and well organized web search result has been a topic of active information Retrieval (IR) research. Irrespective of how small or ambiguous a query is, a user always wants the desired result on the first display of an IR system. Clustering of an IR system's result can render a way, which fulfills the user's actual information need. In this paper, an approach to cluster an IR system's result is presented. The approach is a combination of heuristics and k-means technique using cosine similar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 34 publications
0
5
0
Order By: Relevance
“…They apply beam search in the search result graph in parallel to traditional topical clustering method on the clusters so formed. In [23], authors propose an approach based on the topology i.e. hyperlink and contents of the documents returned by the search engine.…”
Section: Rank-based and Hybrid Search Results Clusteringmentioning
confidence: 99%
“…They apply beam search in the search result graph in parallel to traditional topical clustering method on the clusters so formed. In [23], authors propose an approach based on the topology i.e. hyperlink and contents of the documents returned by the search engine.…”
Section: Rank-based and Hybrid Search Results Clusteringmentioning
confidence: 99%
“…Traditional machine learning models includes K‐Means, k‐nearest neighbor (KNN), 27 multilayer perceptron (MLP), support vector machine (SVM), 28 naive Bayes (NB), DT, 29 and so on. As known, K‐Means and KNN are both classical clustering algorithms, and there are large number of Web‐based analysis conducted using these algorithms, such as References 30,31. However, only a few references related to webshell detection using these two clustering methods are found.…”
Section: Methodsmentioning
confidence: 99%
“…The algorithm determines the frequency when two objects are clustered given two clustering solutions p1 and p2 produced by two different clustering methods. Let T be the similarity measure, as follows [ 55 ]: …”
Section: Proposed Multiview Multirepresentation Cluster Ensemble Mmentioning
confidence: 99%