scholarly journals An Incremental Acquisition Method for Web Forensics

2021 ◽  
Vol 13 (6) ◽  
pp. 1-13
Author(s):  
Guangxuan Chen ◽  
Guangxiao Chen ◽  
Lei Zhang ◽  
Qiang Liu
Keyword(s):  
Real Time ◽  
Digital Forensics ◽  
Recall Rate ◽  
Web Pages ◽  
Web Page ◽  
Content Extraction ◽  
Data Redundancy ◽  
Repeated Acquisition ◽  
Low Efficiency ◽  
Acquisition Method

In order to solve the problems of repeated acquisition, data redundancy and low efficiency in the process of website forensics, this paper proposes an incremental acquisition method orientecd to dynamic websites. This method realized the incremental collection on dynamically updated websites through acquiring and parsing web pages, URL deduplication, web page denoising, web page content extraction and hashing. Experiments show that the algorithm has relative high acquisition precision and recall rate, and can be combined with other data to perform effective digital forensics on dynamically updated real-time websites.

Preeminent System for Detecting Venomous Banking Sites in Online Business

2014 ◽  
Vol 573 ◽  
pp. 519-522
Author(s):  
N.S. Sudharsan ◽  
K. Latha
Keyword(s):  
Real Time ◽  
Web Pages ◽  
Web Page ◽  
Uniform Resource Locator ◽  
Security Issues ◽  
Online Business

. Phishing has become most notorious security issues in online real time web pages. Many studies and ideas have been proposed related to phishing attack in order to overcome the security issues. Phishing attack can be easily done by Uniform resource locator (URL) obfuscation. It is the trick where the user will be forwarded to fake web page which has look and feel effect as the original web page when they click through the fake link. Organizations which use online business and transaction like ebay, paypal use many preventive approaches like blacklist, whitelist of URL in order to prevent any online theft using phishing attack. This paper propose a novel idea for detecting Phishing attack by checking the URL patterns of the suspected page with generated legitimate common URL pattern by inspecting different international URL patterns of that particular banking site.

scholarly journals Dynamic Web Page Security using Fingerprint and Card System

2019 ◽  
Vol 8 (9S3) ◽  
pp. 954-956
Keyword(s):  
Real Time ◽  
Web Pages ◽  
Cyber Crime ◽  
Web Page ◽  
The Real ◽  
Finger Print ◽  
Security Issues ◽  
Dynamic Web ◽  
Card System ◽  
The Given

The Given dynamic web pages have many security issues, and it can be very difficult to handle.The goal of card and finger print system gives more security to dynamic web pages. In this paper, We clearly discuss and workout the real time example with the help of Internet. Specifically, by introducing this technology the cyber crime also be comes underthecontrol.Fingerprintverificationisanimportantbiometric techniqueforpersonalidentification.Inthispaper,wedescribethede signandimplementationofaprototypeautomaticidentityauthentic ationsystemwhichusesfingerprintstoauthenicatetheidentityofani ndividual.

Logical Structure for User Friendly dynamic Web Page Visualization for Small Screen Terminals Promoting E-Business

2020 ◽  
Vol 14 ◽  
Author(s):  
Shefali Singhal ◽  
Poonam Tanwar
Keyword(s):  
Logical Structure ◽  
Vital Role ◽  
Web Pages ◽  
Main Concern ◽  
Web Page ◽  
Large Screen ◽  
Tree Data ◽  
Tree Data Structure ◽  
User Friendly ◽  
Small Screen

Abstract:: Now-a-days when everything is going digitalized, internet and web plays a vital role in everyone’s life. When one has to ask something or has any online task to perform, one has to use internet to access relevant web-pages throughout. These web-pages are mainly designed for large screen terminals. But due to mobility, handy and economic reasons most of the persons are using small screen terminals (SST) like mobile phone, palmtop, pagers, tablet computers and many more. Reading a web page which is actually designed for large screen terminal on a small screen is time consuming and cumbersome task because there are many irrelevant content parts which are to be scrolled or there are advertisements, etc. Here main concern is e-business users. To overcome such issues the source code of a web page is organized in tree data-structure. In this paper we are arranging each and every main heading as a root node and all the content of this heading as a child node of the logical structure. Using this structure, we regenerate a web-page automatically according to SST size. Background:: DOM and VIPS algorithms are the main background techniques which are supporting the current research. Objective:: To restructure a web page in a more user friendly and content presenting format. Method Backtracking:: Method Backtracking: Results:: web page heading queue generation. Conclusion:: Concept of logical structure supports every SST.

Main Content Extraction from Web Pages

2020 ◽  
Author(s):  
Stanislas Morbieu ◽  
Guillaume Bruneval ◽  
Mohamed Lacarne ◽  
Mohamed Kone ◽  
Francois-Xavier Bois
Keyword(s):  
Web Pages ◽  
Content Extraction

Automatic Ontology Learning from Multiple Knowledge Sources of Text

2018 ◽  
Vol 14 (2) ◽  
pp. 1-21 ◽  
Author(s):  
B Sathiya ◽  
T.V. Geetha
Keyword(s):  
Knowledge Base ◽  
Web Pages ◽  
Knowledge Sources ◽  
Statistical Measure ◽  
Ontology Learning ◽  
Web Page ◽  
Semantic Query ◽  
Probabilistic Knowledge ◽  
Discovery Algorithms ◽  
Different Sources

The prime textual sources used for ontology learning are a domain corpus and dynamic large text from web pages. The first source is limited and possibly outdated, while the second is uncertain. To overcome these shortcomings, a novel ontology learning methodology is proposed to utilize the different sources of text such as a corpus, web pages and the massive probabilistic knowledge base, Probase, for an effective automated construction of ontology. Specifically, to discover taxonomical relations among the concept of the ontology, a new web page based two-level semantic query formation methodology using the lexical syntactic patterns (LSP) and a novel scoring measure: Fitness built on Probase are proposed. Also, a syntactic and statistical measure called COS (Co-occurrence Strength) scoring, and Domain and Range-NTRD (Non-Taxonomical Relation Discovery) algorithms are proposed to accurately identify non-taxonomical relations(NTR) among concepts, using evidence from the corpus and web pages.

Semi-Automatic Online Tagging with K-Medoid Clustering

2014 ◽  
Vol 24 (08) ◽  
pp. 1115-1130 ◽  
Author(s):  
He Hu ◽  
Xiaoyong Du
Keyword(s):  
Clustering Algorithm ◽  
Prototype System ◽  
Web Pages ◽  
Web Page ◽  
Web Browser ◽  
User Input ◽  
Browser Extension ◽  
Annotation Process ◽  
Efficiency And Effectiveness ◽  
Automatic Mechanism

Online tagging is crucial for the acquisition and organization of web knowledge. We present TYG (Tag-as-You-Go) in this paper, a web browser extension for online tagging of personal knowledge on standard web pages. We investigate an approach to combine a K-Medoid-style clustering algorithm with the user input to achieve semi-automatic web page annotation. The annotation process supports user-defined tagging schema and comprises an automatic mechanism that is built upon clustering techniques, which can automatically group similar HTML DOM nodes into clusters corresponding to the user specification. TYG is a prototype system illustrating the proposed approach. Experiments with TYG show that our approach can achieve both efficiency and effectiveness in real world annotation scenarios.

scholarly journals A Simulation of the Structure of the World-Wide Web

2002 ◽  
Vol 7 (1) ◽  
pp. 9-25 ◽  
Author(s):  
Moses Boudourides ◽  
Gerasimos Antypas
Keyword(s):  
World Wide Web ◽  
Power Law ◽  
Web Sites ◽  
World Wide ◽  
The Internet ◽  
Web Pages ◽  
Small Worlds ◽  
Web Page ◽  
Simple Simulation ◽  
The World

In this paper we are presenting a simple simulation of the Internet World-Wide Web, where one observes the appearance of web pages belonging to different web sites, covering a number of different thematic topics and possessing links to other web pages. The goal of our simulation is to reproduce the form of the observed World-Wide Web and of its growth, using a small number of simple assumptions. In our simulation, existing web pages may generate new ones as follows: First, each web page is equipped with a topic concerning its contents. Second, links between web pages are established according to common topics. Next, new web pages may be randomly generated and subsequently they might be equipped with a topic and be assigned to web sites. By repeated iterations of these rules, our simulation appears to exhibit the observed structure of the World-Wide Web and, in particular, a power law type of growth. In order to visualise the network of web pages, we have followed N. Gilbert's (1997) methodology of scientometric simulation, assuming that web pages can be represented by points in the plane. Furthermore, the simulated graph is found to possess the property of small worlds, as it is the case with a large number of other complex networks.

Sign in / Sign up

Export Citation Format

Share Document