Simple bounds on the convergence rate of an ergodic Markov chain
Information Processing Letters
A spatial data retrieval and image processing expert system for the World Wide Web
Proceedings of the 21st international conference on Computers and industrial engineering
An internet-based search formalism for design with modules
Proceedings of the 23rd international conference on on Computers and industrial engineering
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Retrieving and organizing web pages by “information unit”
Proceedings of the 10th international conference on World Wide Web
Analysis of assembly through product configuration
Computers in Industry
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Web Site Optimization Using Page Popularity
IEEE Internet Computing
Using PageRank to Characterize Web Structure
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Effectively Finding Relevant Web Pages from Linkage Information
IEEE Transactions on Knowledge and Data Engineering
Implicit link analysis for small web search
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Proceedings of the 13th international conference on World Wide Web
Computers and Industrial Engineering
WebGuard: A Web Filtering Engine Combining Textual, Structural, and Visual Content-Based Analysis
IEEE Transactions on Knowledge and Data Engineering
A Reordering for the PageRank Problem
SIAM Journal on Scientific Computing
The Google Similarity Distance
IEEE Transactions on Knowledge and Data Engineering
A graph method for keyword-based selection of the top-K databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Balanced outcomes in social exchange networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Large-scale collaborative analysis and extraction of web data
Proceedings of the VLDB Endowment
AnchorWoman: top-k structured mobile web search engine
Proceedings of the 18th ACM conference on Information and knowledge management
Categorical data skyline using classification tree
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Adaptive Hierarchical Surrogate for Searching Web with Mobile Devices
IEEE Transactions on Consumer Electronics
Hi-index | 0.00 |
The enormous growth in information technology has revolutionized the way people can access information sources. Web search engines have played an important role to support what the user wants precisely and efficiently from the vast web database. Different from conventional search engine approaches, searching the structure of the web, where the answer comprises more than a single page connected by hyperlinks, needs to be meritoriously developed. We propose Linear Programming models in order to generate the optimal structured web objects searching for relevant web graphs. In the model, the web objects with node and edge weights that represent the ranking measures for Webpages and hyperlinks are devised to rank the relevance in terms of keyword vectors. We also developed a tree-filtering algorithm and top-k Steiner tree algorithm that is used to provide the search recommendations in practical applications. With real web databases, the experimental study shows that the LP approach outperforms the conventional search engines with respect to execution time and quality of results.