• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Learning Association Rules and Tracking the Changing Concepts on Webpages: An Effective Pornographic Websites Filtering Approach

    2018-04-08 03:11:16JyhJianSheu

    Jyh-Jian Sheu

    1.Introduction

    Due to the development of the Internet, the population age of Internet users gradually declined. A social survey conducted in June 2010 in UK shows that about 1/3 children have browsed pornographic websites before the age of 10. Browsing pornographic websites at an early age can easily produce an adverse impact on children; many European countries have formulated relevant laws and regulations to filter pornographic websites[1]. For example, the Netherlands government passed a law to empower the police with relevant rights to filter pornographic websites. However, when strengthening the filtering of pornographic websites, it can often result in the problem of over-blocking. Thus, using appropriate filtering software and technology has become a major issue at present.

    Currently, pornographic information spread on the Internet is in the forms of text, pictures, and videos. The pornographic information will import sensational senses into the minds of young people. At the same time, stimulating and provocative words, pictures, and videos of pornographic materials may result in the abnormal gender concepts in the period of character and personality cultivation period. More seriously, it may lead to severe sexual harassment, underage rape, abortion,infectious diseases, and other social problems. As a result, the issue has attracted the attention of families and governments around the world[1]-[3].

    Online pornographic information can be disseminated by any computer in the world. Governments around the world should classify and manage Web content. World Wide Web Consortium (W3C) proposed the Platform for Internet Content Selection (PICS) as a network classification standards system(http://www.w3.org/PICS/). There are many studies on filtering software and a number of commercialized databases of blacklists in the market[4],[5]. Moreover, there are some inappropriate content blocking and filtering software for downloading by users. However, in the face of rapid changes in the Internet, how to effectively update and improve filtering accuracy has become an issue worthy of discussion.

    In recent years, as data mining technology advances,scholars have applied various machine learning methods to successfully filter pornographic webpages, and such machine learning methods include: Na?ve Bayes[6], support vector machines (SVM)[7], and decision tree[8]; methods using natural language as the filter include neural networks[9], K-nearest neighbors[10]; the currently common webpage filtering and analysis methods include keyword matching[11], uniform resource locator blocking (URL blocking)[12],[13]and image analysis[14]-[17].

    However, these pornographic webpage filtering methods proposed in the past have inadequacies. In keyword filtering, with given keyword database, keywords of higher frequency are often stored in the keyword database. The accuracy of filtering by using keyword only is challenged and doubted since the main problem of keyword filtering is the determination of semantics and times of occurrences.The URL analysis is based on sources and descriptions of URLs. The URL of a pornographic website might contain the fragment word of “SEX” or “PORN”. However, many pornographic websites’ URLs are often composed of irrelevant words or random numbers. Therefore, the effect of filtering by using website URL is quite limited. Most the current URL-related studies propose to establish the whitelists and blacklists, including the blocking of the URLs on the lists. URL on the white list will be allowed.The disadvantage of such a method is that it takes a lot of costs to maintain and update the URL list to keep the accuracy rate of the filtering system[18]. The webpage image analysis is to determine a picture as pornographic or not by the color distribution, shape, and vector graphs of the picture. The problem of the filtering method is the lack of accuracy, and it will consume a lot of time. The independent hypothesis of Na?ve Bayes is too simple to be consistent with the real environment[19]. Among the data mining machine learning methods, the problem of decision tree techniques is that the growing process of the decision tree is not applicable for streaming data. To address this problem, scholars use the data mining method of concept drift[8]. By using such a skill, even the content of the data change over time, the decision tree can strengthen learning to solve the problem mentioned above.

    The real-world database is not static but changing with time. For example: After the American popular singer Lady Gaga staging a spicy performance in MV, in the same period of time, many articles on the pornographic website may also have a large number of keywords relating to Lady Gaga. After a period of time, as the news event fades, the occurrence of such keywords may be reduced relatively.Similar themes may be used as the eye-catching titles of the pornographic website. The phenomenon of pornographic website content changing with time and the real event is known as “concept drift”[8],[20]. Therefore, the model originally established by using machine learning filter should be updated regularly to fit the real world information.

    Solutions to the concept drift problem can be roughly divided into three types as suggested in literature:

    1) Instance selection: The main purpose of this method is to find out the data instances relating to current concept. The most common technology is window-based method[19],[21],[22]. The data instances of the latest concepts are stored in the window with limited capacity. When data instances of the new concept are added and the window is filled up, the data instances of the old concept will be moved out of the window. The data instances of the current concept will be recorded by using such a method.Moreover, the occurrence of concept drift in the future can be predicted by observing the data instances of the concept in the window. However, it is unfair to control concept drift by the quantity of data instances in the window and it is unable to present the time weights of the data instances in the window.Therefore, scholars proposed new algorithms to dynamically adjust the quantity of windows in order to judge the phenomenon of concept drift effectively[23].

    2) Instance weighting: This method gives different weights to data instances. Each data instance will be assigned a weight according to its arrival time[24]. For example, the weight of each data instance is determined by factors including the time of life.Then, the classifier will compute the classification results of data instances in accordance with their weights. Note that a data instance should be disposed if it exceeds the predetermined time scope.

    3) Ensemble learning method: This method applies more than two classifiers’ weighted voting to determine the adoption of the classifier. Different classifiers are used to predict the classification results and assign different weights in case of various circumstances. It combines different classifiers and selects out optimal combinations to achieve the best classification results in order to solve the concept drift problem[25].

    In this paper, we apply the uncomplicated machine learning manner and the decision tree data mining technology to propose an efficient method of filtering pornographic webpages, which is possessed of the capability of tracking the concept drift on webpages. The ultimate goal of this study is to improve the filtering accuracy and reduce the cost of filtering pornographic webpage; through data mining, the proposed method can filter not only URL, but also scan the content (body).Regarding URL features and content features, we use the decision tree algorithm to learn association rules between webpage’s category (pornographic webpage, normal webpage) and these feature attributes. Based on the resulted rules, we will propose a more efficient filtering mechanism of pornographic webpages with the following major advantages:

    a) Regarding the solution to the problem of tracking concept drift in pornographic webpages, we propose a weighted window-based technique to estimate for the condition of concept drift for the keywords found recently in pornographic webpages. This technique will help our filtering method in recognizing the pornographic webpages.

    b) We check only contexts of webpages without scanning pictures in order to avoid the low operating efficiency in analyzing photographs. Furthermore, the error rates that classify pornographic webpages as normal or the normal ones as pornographic will be lowered and the accuracy of filtering will be enhanced concurrently.

    c) An incremental learning mechanism is proposed to increase the pornographic keyword database. By increasing and updating the pornographic keyword database incrementally, it will make the proposed filtering method better suitable for the dynamic environment.

    The remainder of this paper is organized as follows.Section 2 introduces the features of pornographic websites and the decision tree data mining algorithm. In Section 3, we describes the detailed architecture of our filtering method proposed in this paper. The experimental results of our method are presented in Section 4. Section 5 concludes this paper.

    2.Features of Pornographic Webpage and Decision Tree Algorithm

    2.1 Features of Pornographic Webpages

    The hypertext markup language (HTML) is mainly used to structure information (such as titles, paragraphs, tables,etc.). It could also describe the appearance and semantics of text. On the Internet, there are websites that incorporate all kinds of media, such as text, images, videos, and audios,and present them to the users via browsers. This is further achieved through HTML, the markup language that enables the browsers to process and present the contents of raw files. HTML will classify the various features into different elements and attach special marks to signify the composition of these files. The marks that indicate the start and end of the content, as well as to which element the content belongs, are called “Tags”. HTML is thus comprised of various elements, Tags, and attributes. During the operations of HTML, only Tags will be recognized,while paragraphs and capitalization are negligible. Note that each Tag is wrapped up by the paired “<” and “>”. The HTML structure is basically expressed by Tags as follows:

    <Element_Name Attribute_Name= “Value”> Content of the Element </Element _Name>

    The symbol “<” represents the start of this Tag;“Element_Name” and “Attribute_Name” are comprised of English letters; “Value” is comprised of English letters or numbers; the symbol “>” represents the end of the Tag; the symbol “/” represents the end of symmetrical Tag. Table 1 presents some examples of elements in webpage files[9].

    Fig. 1 is the omitted version of the source code of a real pornographic webpage. The source code is comprised of a series of HTML syntax, and the content is made up of such Tags as the title, content, image, and hyperlink. Lee et al.[9]studied and pointed out the parts of this source code most likely to be dominated by pornographic keywords. Take Fig. 1 for example, a suspected pornographic keyword “Adult” is discovered in the fourth line around the Tag “<title>” and such a statement as “Warning, this part of MostPlays contains adult related content!” is seen on the fourteenth line around the Tag “<strong>”, a warning stating that this is an adult webpage.

    Suspected pornographic words are often found on pornographic webpages, such as indecent, provocative, or sex-related text, which all will be called “pornographic keywords” here. The following parts are common places on HTML codes where pornographic keywords are likely to exist. For the sake of convenience, “PORN” will be used to represent pornographic materials (keywords).

    Table 1: Some elements of webpage

    Fig. 1. Omitted version of the source code of a real pornographic webpage file.

    1) The content of “URL”: Suspected pornographic keywords might be contained in the URLs of pornographic webpages. But since the names of most webpages are expressed in English and meaningless alphabetic arrangement or numbers tend to be used to avoid attention,it is not efficient enough to decide whether a website is pornographic in nature by relying on URLs alone. The ULRs with pornographic keywords might be written in HTML as

    URL://www.PORN.com.

    2) The page title defined by Tag “<title>”: The defined title will be displayed on the title bar of the browser, and usually the default title in the users’ “favorite” or“bookmark”. It is usually used by pornographic webpages to denote the eye-catching title with pornographic keywords and written in HTML as

    <title>PORN</title>.

    3) The metadata defined by Tag “<meta>”: It describes the metadata of a webpage and includes several kinds of parameters. For example, “author” is used to indicate the author of webpage, “description” is used to record the synopsis of webpage, and “keyword” is used to define keywords of webpage to facilitate the search engines.However, such information will not be displayed while the users are browsing webpages. The pornographic keywords are likely to be written in HTML as

    <meta name=“author” content=“PORN”>

    <meta name=“description” content=“PORN”>

    <meta name=“keyword” content=“PORN”>.

    4) The external files or resources denoted by the Tag“<link>”: This Tag is used to set the relationships between the files, namely the hyperlinks. The pornographic materials are likely to be written in HTML as

    <link href=“PORN”>.

    5) The image denoted by the Tag “<img>”: The Tag“<img>” is designed to control the images in webpages.The parameter “src” refers to the source URL of the specified image, while “alt” refers to the text designed to replace the specified image. When the browser of the user does not support the file’s type of this image, these words defined by “alt” will appear instead. The function of “title”is similar to that of “alt”, namely, when the browser does not support “alt”, “title” will be used instead. They are written in HTML as

    <img src=“PORN” alt=“PORN” title=“PORN”>.

    6) The hyperlink defined by Tag “<a>”: This Tag indicates a hyperlink and a textual description is followed.Both of them are usually utilized by the pornographic webpages as follows

    <a href=“PORN”>PORN</a>.

    7) The text defined by the Tag “<body>”: This part refers to the textual content of the webpage files, in which the suspected pornographic keywords might be found directly. They are written in HTML as

    <body>PORN</body>.

    The pornographic webpages may not contain all the above items but parts of the above items. Therefore, by analyzing the pornographic webpage’s features and studying the common places on HTML codes where pornographic keywords are likely to exist, we can design some important attributes to help filter pornographic webpages effectively, which will be discussed in Section 3.

    2.2 Decision Tree Data Mining Algorithm

    In this paper, we propose an efficient systematized filtering method based on decision tree data mining technique to filter pornographic webpages. Decision tree algorithms are effective data mining methods upon the tree data structure, and they can find the potential association rules of data to predict (or classify) the unknown data whereas the statistical methods can only compute the superficial distribution of data.

    Among various decision tree algorithms, Iterative Dichotmiser 3 (called ID3 for short) proposed by Quinlan is the most well-known one[26]. ID3 only supports categorical attributes. However, C4.5 (an improved method of ID3) can support both categorical attributes and numerical attributes simultaneously[27]. Since the data attributes adopted in this paper are the mixture of numerical type and categorical type, we select C4.5 as the major data mining method to build an efficient systematized method of filtering pornographic webpages.

    We assume that “target attribute” is the attribute which is concerned objective in this paper (that is, the attribute“webpage’s type”, whose value “P” means it is a pornographic webpage and value “L” means it is a legitimate one) and “critical attributes” are the other influential attributes for classifying pornographic webpages.The process of building decision tree will start from the root node, and all data instances are initially contained in this root node. The C4.5 algorithm will select a critical attribute with the maximum “gain ratio” but not yet selected (the detailed process of computing gain ratio will be described later). Then, all data instances in the root node will be divided into disjoint children nodes according to their values of this selected critical attribute. Subsequently, the same process will be repeated respectively by each of those children nodes for its own data instances[27].

    Now we introduce the process of computing the gain ratio.Assume that the current node is C. Given a certain critical attribute A, the gain ratio of A will be denoted as GainRatio(A),which concerns its “information gain” of A (denoted influential Gain(A)) and “entropy” of node C (denoted as E(C)). E(C) is computed by

    where piis the number of data instances corresponding to the ith value of target attribute in C, n is the total number of data instances in C, and t is the number of target attribute’s values. Then, Gain(A) is calculated by:

    where k is the number of values of A, Cjwith 1≤j≤k is a subset of C including the data instances corresponding to the jth value of A, and njis the number of data instances contained in Cj. Finally, we can compute GainRatio(A) by the following formulas:

    There are two basic stop conditions to end the construction process of the decision tree of the C4.5 algorithm: 1) all critical attributes are selected; 2) target attribute’s values of all data instances in this current node are exactly the same. If any of the two stop conditions is satisfied, the construction process of decision tree will be stopped and this current node will be signified as a leaf node by performing the following ending process.

    Assume that C is the current node that will be signified as a leaf. Then, C will be labeled by the value of the target attribute possessed by the majority of data instances in C, which is denoted as Label(C). Let Label(C) be the number of data instances whose target attribute’s value is Label(C) in the node C. Then, compute the degree of purity (denoted as Purity(C)) and degree of support (denoted as Support(C)) for the node C, and end the construction process of the decision tree. The formulas of Purity(C) and Support(C) are defined as follows:

    where N is the number of total data instances and |C| is the number of data instances contained in the node C.

    In this paper, we propose another stop condition to avoid excessive growth of decision tree as follows. Suppose that the current node is C, if Purity(C) is lower than 20% or higher than 90%, or Support(C) is below 10%, the construction process of decision tree will be stopped; on the contrary, if Purity(C) is between 20% to 90% or Support(C) is higher than 10%, it will go on growing. Now we introduce the detailed procedure of the C4.5 algorithm[27]as follows.

    Step 0. All data instances are stored in the root node, select a critical attribute, say A, with the maximum gain ratio. Divide all data instances into disjoint children nodes according to their values of the selected critical attribute A. Then the following steps will be executed for each children node.

    Step 1. If the target attribute’s values of all data instances in the current node are exactly the same, then signify this node as a leaf node, perform the ending process,and stop.

    Step 2. If all critical attributes have been selected, then signify the current node as a leaf node, perform the ending process, and stop.

    Step 3. Treat the current node as node C. If any of Purity(C)<20%, Purity(C)>90%, and Support(C)<10% is satisfied, then signify this node as a leaf node, perform the ending process, and stop.

    Step 4. Calculate the gain ratio for each critical attribute that is not selected yet. And select the critical attribute with the maximum gain ratio. Then divide all data instances into disjoint children nodes according to their values of the selected critical attribute.

    Step 5. Repeat Step 1 to Step 5 for each of the children nodes generated in Step 4 respectively.

    Finally, the decision tree will be built. In the resulted decision tree, each leaf node will be labeled as a value of the target attribute. Each path from the root node to a leaf node will form an association rule such that all internal nodes on this path constructed a row of “if” judgment of the critical attributes. With the “then” result denoted by the labeled value of the leaf node, an association rule of “ifthen” pattern will be constructed.

    3.Efficient Method of Filtering Pornographic Websites

    In this paper, we use machine learning manner and decision tree data mining algorithm to propose an efficient pornographic websites filtering method, which will be possessed of the capability of tracking the concept drift on webpages. We choose the C4.5 algorithm as the major decision tree data mining method applied in this study. Based on the technique of machine learning, the proposed method will learn the association rules about pornographic webpages from training data (known webpages, which have been classified as either pornographic or legitimate one), thus filtering the unknown webpages on the basis of these rules.

    As illustrated in Fig. 2, the architecture of the proposed method can be divided into two stages: 1) training stage and 2)classification stage, which will be introduced as follows.

    3.1 Training Stage

    The purpose of this stage is to find association rules about pornographic websites by analyzing “training webpages”. The training webpages are known webpages that have been classified as either pornographic or legitimate one. Then, the resulted association rules will be applied to classify the unknown webpages in the classification stage.

    In the first step of this stage, the training webpages should be examined by the features extraction module to extract their important features which can be used to identify pornographic webpages. Note that the factual category of each training webpage will be regarded as the target attribute in this study. The target attribute of a training webpage will be valued as “P” if it is pornographic,and valued as “L” if it is legitimate. Moreover, we have designed 16 important attributes as the critical attributes,whose values will be computed by the features extraction module and concept drift scoring module. Then, the decision tree data mining module will perform the C4.5 decision tree algorithm to analyze the training webpages and compute association rules between 16 critical attributes and the target attribute. Finally, we will score the association rules, and store them into the rule database,which will be accessed in order to classify the unknown webpages in the next stage, i.e., the classification stage. The detailed steps of this stage are elaborated on as follows.

    Fig. 2. Architecture of the proposed method.

    3.1.1Features Extraction Module

    In this module, each webpage will be analyzed to decide its critical attributes’ values by performing the following two steps: 1) preprocessing and 2) capturing attributes.

    1) Preprocessing

    In this step, each webpage should be converted into the HTML format. Then, spaces, punctuations, and stop-words of the words in webpage content will be removed. Moreover, we execute the Porter stemming algorithm[28]to reduce repetitively arising words with different types. For example,“apple” and “apples” will be reduced to “appl” after stemming performed.

    2) Capturing attributes

    This step is designed to decide the values of critical attributes for each webpage. In order to filter pornographic webpages accurately, we will perform some judgments based on the suspicious elements of HTML structures, as well as the frequency of pornographic keywords. Based on the research of Lee et al.[9]about the parts of the HTML code mostly likely to be dominated by pornographic keywords, we study and outline a number of critical attributes as shown in Table 2. For the sake of convenience, we use “XXX” to indicate the strings that pornographic keywords might appear. As described in Table 2, the critical attributes from No. 1 to No. 14 will be valued as 0 or 1 by checking whether the corresponding HTML elements of each webpage meet the judgment conditions.Moreover, these critical attributes will be examined whether they contain pornographic keywords via the keyword database.In this research, the pornographic keywords stored in the keyword database are collected from the website SafeSquid(http://www.safesquid.com/).

    The 15th critical attribute (No. 15) is to check whether the webpage contains more than three keywords that can be found in the sliding window. The content of the sliding window will be introduced in the next module (concept drift scoring module). Moreover, the 16th critical attribute (No. 16) will also be handled in the concept drift scoring module.

    3.1.2Concept Drift Scoring Module

    In this module, we use a window-based technique to estimate for the concept drift condition of pornographic keywords in each webpage. We propose a weighted “sliding window” to keep the keywords found recently in pornographic webpages. The size of the sliding window is defined to be 30 days. That is to say, the sliding window will store the keywords found frequently in the past 30 days. We assume that all of the webpages are entered into the proposed filtering system in the increasing order of the webpage’s date. For each webpage, this module will execute the following three tasks sequentially: 1) deciding the value of the 15th critical attribute; 2) calculating the score of concept drift; 3) updating the sliding window.

    1) Deciding the value of the 15th critical attribute

    Each incoming webpage will be checked whether it contains more than 3 keywords that have been recorded in the sliding window. The 15th critical attribute (as shown in Table 2)will be set as 1 if this incoming webpage contains more than 3 keywords that can be found in the sliding window, and set as 0 otherwise.

    Table 2: Sixteen critical attributes used in this research

    2) Calculating the score of concept drift

    Suppose that a new webpage, denoted as w, is entered into the system. Moreover, we assume that this webpage includes k keywords which can be found in the sliding window. Without loss of generality, we let these keywords be denoted as Keyword(i) for 1≤i≤k where k is a positive integer. The following functions are necessary to calculate the concept drift score of this webpage w:

    a) Keyword_Frequency(i): Keyword’s frequency is a significant criterion of concept drift, hence we propose this function to accumulate the found times of Keyword(i) since it was stored into the sliding window. Whenever the same keyword, Keyword(i), is found in the incoming webpage, the value of Keyword_Frequency(i) will be increased by 1.

    b) Webpage_Date(w): This function records date time of the current webpage w.

    c) Access_Date(i): This function records the latest date time that Keyword(i) was found in an incoming webpage previous to w.

    d) Time_Differ(i): This function is to calculate the sustained time owing to the latest date time that Keyword(i)appeared in an incoming webpage previous to w. It is computed by using the following formula:

    Time_Differ(i)=Webpage_Date(w)–Access_Date(i)

    e) Time_Weight(i): The concentrated appearance of a new keyword usually implies occurring of concept drift. The purpose of this function is to compute the weighted value of estimating the degree of concentrated appearance for each keyword. Obviously, the concentrated appearance of a keyword will result in the smaller value of Time_Differ(i), therefore, its weighted value should be greater. Assume that the units of measurement for Time_Differ(i) are days, the weighted value will be calculated by

    Time_Weight(i)=30–Time_Differ(i).Now, we can compute Concept_Drift_Score(w), the score of concept drift of the current webpage w, by using the following equation:

    Thus, the value of the 16th critical attribute (No. 16 of Table 2) of each incoming webpage can be acquired.

    3) Updating the sliding window

    Whenever a pornographic webpage is entered into the system, each keyword found in this webpage will be considered as a candidate for storing into the sliding window.In our method, there are three cases of updating the content of sliding window: (I) adding new keywords during the training stage; (II) updating the values of related functions; (III) adding new keywords by the incremental learning module of the classification stage.

    Case (I) occurs in the training stage. If a pornographic training webpage is entered into the system, we will check each keyword found in this webpage whether it has been stored in the sliding window. If the keyword is not recorded in the sliding window, we store it into the sliding window and initialize the values of its related functions as mentioned above.

    Case (II) occurs whenever a keyword that has been stored in the sliding window is found in an incoming webpage. If a keyword (say, Keyword(i)) stored in the sliding window is found in an incoming webpage, we will modify its related functions’ values as follows: 1) adding 1 to its frequency value (i.e., Keyword_Frequency(i)); 2) changing its latest accessed time (i.e., Access_Date(i)) into the date time of this incoming webpage.

    Case (III) occurs in the classification stage. If an unknown webpage is classified as pornographic, the incremental learning module of the classification stage will check each keyword found in this webpage; if this keyword has not been recorded in the sliding window yet, it will be stored into the sliding window and the values of its related functions will be initialized.

    Therefore, the webpage with recurring keywords will gain greater weights in calculating its concept drift score (as mentioned earlier). Thus, this module will help improve the accuracy of identifying pornographic webpages by adding recurring keywords into the sliding window. Note that the sliding window store the keywords found frequently within the past 30 days in our method. Each keyword with the Time_Differ(i) more than 30 days will be deleted automatically.

    3.1.3Decision Tree Data Mining Module

    Now, the values of all critical attributes of each training webpage are acquired. In this module, the decision tree data mining algorithm C4.5 will be applied to all training webpages. The C4.5 algorithm will construct a decision tree and bring out the potential association rules of “if-then”pattern between 16 critical attributes (as described in Table 2) and target attribute (webpage’s type: Pornographic or legitimate). Then, this module will score each association rule by using formulas based on the values of the degree of support and the degree of purity, which have been defined in Section 2.

    Given any association rule R, we assume that the associated leaf node is C, and p is the number of webpages whose target attribute’s value is “P” (pornographic) in node C. To describe the scoring formula for the rule, the following four important functions are necessary.

    1) P_Degree(R): This function records the “pornographic degree” for rule R, which implies the “intensity” of rule R to classify an unknown webpage as “P” (pornographic). Let |C|be the number of webpages contained in node C, this function is defined as follows:

    2) Rule_Support(R): This function records the degree of support for rule R, which is defined as follows:

    3) W(Rule_Support(R)): This function records the weighted value for Rule_Support(R). We compute the values of the degree of support for all rules and assume that Rule_SupportMAXis the maximum one and Rule_SupportMINis the minimum one.Then this function can be defined as follows:

    4) Score(Rule_Support(R)): The function calculates score for Rule_Support(R). We compute the weighted values of rule support for all rules by using above formula of W(Rule_Support(R)), and assume that WeightMAXis the maximum one and WeightMINis the minimum one. Then, this function can be calculated as follows:

    Now, we can describe the formula of computing score for rule R. Let the score of rule R be Score(R), which is defined as follows:

    Then, we compute scores for all association rules. We choose the minimum score from the rules whose values of pornographic degree are more than 80% (i.e., P_Degree(R)≥80%), and set it as the threshold, denoted as “t_value”, for judging whether an unknown webpage is pornographic. The results obtained by above steps will be stored in the rule database and accessed by the following stage (classification stage) to classify unknown webpages accordingly.

    3.2 Classification Stage

    With the rule database computed by the training stage, now the classification stage will classify unknown webpages to be either pornographic or legitimate.

    The first step of this stage is to examine unknown webpages;the features extraction module will compute values of critical attributes from No. 1 to No. 14 (as shown in Table 2) and the concept drift scoring module will compute the 15th and 16th critical attributes for each unknown webpage. Then, the webpage scoring module will use these 16 critical attributes to inquire the rule database and in order to find the score for each unknown webpage. Therefore, we can judge whether this unknown webpage is pornographic by comparing its score with the threshold of classification (i.e., t_value). Finally, if an unknown webpage is classified as pornographic, the incremental learning module will be started up to learn new pornographic keywords into the sliding windows and keyword database. The detailed process of this stage can be partitioned into the modules as follows.

    3.2.1Features Extraction Module

    This task of this features extraction module is identical to that of the training stage. In this module, each unknown webpage will be analyzed to extract its critical attributes’values by performing the following steps: 1) preprocessing;2) capturing attributes.

    Like the steps of the features extraction module in the training module, the step “preprocessing” is to convert each unknown webpage into HTML format and reduce its noise in webpage content. Then, the step “capturing attributes”will compute the values of 14 critical attributes (from No. 1 to No. 14 as shown in Table 2) for each unknown webpage.

    3.2.2Concept Drift Scoring Module

    For each unknown webpage, this module will execute the following three tasks: 1) deciding the value of the 15th critical attribute; 2) calculating the score of concept drift; 3) updating the sliding window.

    1) Deciding the value of the 15th critical attribute

    The 15th critical attribute (as shown in Table 2) will be set as 1 if this unknown webpage contains more than 3 keywords that can be found in the sliding window, and set as 0 otherwise.

    2) Calculating the score of concept drift

    The process of this task is the same as that of the concept drift scoring module in the training stage, which will compute the score of concept drift for each unknown webpage to estimate for the condition of concept drift in this webpage.Thus, the 16th critical attribute (No. 16 of Table 2) of this unknown webpage will be extracted.

    3) Updating the sliding window

    Whenever any keyword of sliding window is found in an unknown webpage, we will modify its related functions’values. Let this found keyword be Keyword(i). We execute the following two modifications for Keyword(i): 1) adding 1 to its frequency value, i.e., Keyword_Frequency(i) and 2)rewriting its latest accessed time, Access_Date(i), as the date time of this unknown webpage.

    3.2.3Webpage Scoring Module

    Now, all the 16 critical attributes (as described in Table 2)of this unknown webpage have been extracted. According to these critical attributes’ values, this unknown webpage will dovetail with some association rule stored in the rule database built. Assume that this dovetailed rule is R. Then,we designate the score of this unknown webpage as Score(R),which is defined as the formula described in the decision tree data mining module of the training stage. This unknown webpage will be classified as pornographic if its score is not lower than the classification threshold (i.e., Score(R)≥t_value),and classified as legitimate otherwise.

    3.2.4Incremental Learning Module

    At this time, each unknown webpage has been classified to be either pornographic or legitimate. If an unknown webpage is classified as pornographic, this module will check each keyword found in this webpage by using the supervised learning technique.

    If any keyword found in this pornographic webpage has not been recorded in the sliding window yet, it will be stored in the sliding window and the values of its related functions will be initialized. Moreover, we will check whether this pornographic webpage contains any new pornographic keyword that is not recorded in the keyword database. If so, each of new pornographic keywords will be stored in the keyword database.

    Therefore, this module will help improve the accuracy of identifying pornographic webpages by learning incrementally new pornographic keywords to enrich the keyword database and adding recurring keywords into the sliding window to ameliorate the detection of concept drift. Hence, our filtering method can better satisfy the current time concept when reviewing and recording the webpage content characteristics to allow the filtering system better fit for the dynamic environment.

    4.Experimental Results

    4.1 Experimental Design

    In this study, we used the decision tree data mining technique to analyze pornographic webpage content information to speed up the filtering velocity of pornographic webpage filter. The mechanisms to judge the occurrence of concept drift and carry out the incremental learning were also included to improve webpage filter precision. Then, we designed some experiments to confirm the accuracy and efficiency of the proposed filtering method.

    The webpage data used in the experiments was from the pornographic webpage database provided by the website of URLBlack.com (http://urlblacklist.com/). We collected 600 pornographic webpage files each month during the period from February to May 2011 and a total of 2400 pornographic webpage files were collected. Let these webpages be sorted in the increasing order of the date time.According to the date time, we classified these webpages into four groups such that “Month (I)” contained the webpages of February, “Month (II)” contained the webpages of March, “Month (III)” contained the webpages of April, and “Month (IV)” contained the webpages of May.The purpose of this classification was to test whether filtering precision of each month could be improved due to the incremental learning mechanisms of the keyword database and sliding window. For the sake of experimental fairness, the monthly pornographic webpage and normal webpage file data were mixed in the proportion of 1:1. In the training stage, we selected randomly 300 pornographic webpages of each month as the training data, which were mixed with 300 legitimate webpages. In the classification stage, we took the remaining 300 pornographic webpages of each month as the unknown data, which were mixed with 300 legitimate webpages. Moreover, these webpages of each month would be applied to the experiments in the increasing order of date time.

    To measure the experimental performance of the proposed systematic method in terms of webpage filtering accuracy, in addition to the indexes: “Precision” and“Recall”, which were commonly used for document classification, we calculated the harmonic mean “F-measure”. As shown in Table 3, we used the decision confusion matrix to explain the calculation equations listed below[29]. The four cases A, B, C, and D in Table 3 are all recorded by the number of webpages.

    Table 3: Four cases of judgment

    1) Accuracy rate

    It refers to the ratio of webpages classified correctly. It is the probability of legitimate webpages being classified as legitimate and pornographic webpages being filtered as pornographic. The equation is as shown below:

    2) Precision rate

    It refers to the ratio of the webpages identified correctly in the webpages classified as the certain category,representing filter’s capability to classify correctly such category of webpages. The “PornographicPrecision” is computed from the viewpoint of identifying the pornographic webpages; and “LegitimatePrecision” is computed from the viewpoint of identifying the legitimate webpages. Finally, “Precision” is set as the average of the addition of PornographicPrecision and LegitimatePrecision,and the equations are as follows:

    3) Recall rate

    It refers to the probability of identifying correctly the certain category of webpages. The “PornographicRecall” is defined as the probability of judging pornographic webpages as pornographic ones. And the“LegitimateRecall” is defined as the probability judging correctly legitimate webpages. Finally, “Recall” is set as the mean of PornographicRecall and LegitimateRecall, and the equations are as follows:

    4) F-measure

    Regarding the F-measure of a harmonic mean of Precision and Recall, the equation is as follows:

    To confirm the efficiency of our filtering method proposed in this paper, we performed the following three experiments:

    ■ Experiment (A): This experiment performed the proposed method of this paper without using the incremental learning module. In other words, the new keywords of pornographic webpages identified in the classification stage would not be stored into neither the keyword database nor the sliding window.

    ■ Experiment (B): This experiment performed the proposed method with using the incremental learning module to increase the keyword database only. In other words, we stored the new pornographic keywords of pornographic webpages identified in the classification stage into the keyword database only.

    ■ Experiment (C): This experiment performed the proposed method with using the incremental learning module to increase both the keyword database and sliding window.Namely, for each pornographic webpage identified by the classification stage, we not only stored its newly found keywords into the sliding window but also stored its newly found pornographic keywords into the keyword database.Therefore, the proposed method in this paper would better satisfy the current time concept to allow the filtering system better fit for the dynamic environment.

    4.2 Experimental Results

    Now we discuss the results of the three experiments. As shown in Table 4, the averaged accuracy rate of Experiment(A) (performed the proposed method without using the incremental learning module) was 91.80%, which was the lowest among the three experiments. Without incremental learning, the content of keyword database was stationary,i.e., the number of pornographic keywords stored in the keyword database was fixed. However, the webpages’contents in the real world were not fixed. Hence, the filter’s capabilities of filtering pornographic webpages were quite limited. Many pornographic webpages of the unknown ones could not be accurately judged and thus the accuracy rate was relatively low.

    Table 4: Accuracy rate of the three experiments

    On the other hand, the proposed method could add new pornographic keywords increasingly into the keyword database by using the incremental learning module. Thus, the averaged accuracy rate of Experiment (B) was raised to 94.85%,suggesting the incremental learning technique could significantly improve the accuracy of filtering pornographic webpages.

    Moreover, Experiment (C) used the incremental learning module to detect recurring keywords and store them into the sliding window to help evaluate the concept drift condition of webpage, hence, its accuracy rate was the highest among three experiments at 97.06%.

    The experiments results showed that the accuracy rate of our filtering method proposed in this paper would improve over a number of months. Note that the accuracy rate was the ratio of webpages being accurately filtered, namely, legitimate webpages were classified by the proposed method as legitimate ones while pornographic webpages were classified by the proposed method as pornographic ones. Without any incremental learning, as the Experiment (A) used the fixed keyword database to classify the unknown webpages, the resulting accuracy rate was obviously lower. The highest accuracy rate in the case of having no incremental learning was 93.33%. By using the incremental learning technique to add new pornographic keywords into the keyword database, the accuracy rate of Experiment (B) significantly increased over the four months, suggesting that incremental learning can substantially contribute to the identification of pornographic webpages. The Experiment (C) used incremental learning technique coupled with the sliding window to store the recurring keywords, which would help evaluate the concept drift condition of webpage. As the experimental results suggested, the accuracy rate of the Experiment (C) could be improved outstandingly and the highest value reached 98.33%.

    Changes of the precision rate by month were shown in Table 5. Note that the precision rate was the percentage of webpages identified correctly in the webpages judged as the certain category. Without any incremental learning, the precision rate of Experiment (A) was obviously lower than those of Experiments (B) and (C). With incremental learning,by unceasingly adding new pornographic keywords into the keyword database, the precision rate of Experiment (B)significantly improved, and the highest value was 96.77%. In Experiment (C), the weighted sliding window was used to record the recurring keywords. Then, the precision rate of Experiment (C) reached 98.67% in Month (IV) and was the highest among these three experiments. Hence, compared with Experiment (B), the proposed method with both incremental learning and detection of concept drift would further enhance the precision obviously.

    Table 5: Precision of the three experiments

    The monthly changes in the recall rate of the proposed method were shown in Table 6. Note that the recall rate was the ratio of identifying correctly the certain category of webpages. Without any incremental learning, the recall rate of Experiment (A) was the lowest, and the highest value was 92.76%; with the help of the new pornographic keywords added to the keyword database, the recall rate of Experiment(B) was significantly improved due to the technique of incremental learning, and the highest value was 97.99%; in the case of integrating the sliding window with incremental learning, the recall rate of Experiment (C) was slightly improved and the highest value was 98.01%.

    Table 6: Recall of the three experiments

    Table 7 illustrated the monthly changes in F-measure, the harmonic mean of the precision rate and recall rate, of identifying unknown webpages by the proposed method.Without any incremental learning, the F-measure of Experiment (A) was the lowest. With incremental learning of adding new pornographic keywords into the keyword database to help identify the pornographic webpages, the F-measure of Experiment (B) significantly improved and reached 97.38% in Month (III). It could be observed that the incremental learning technique would lead to significant difference in identifying unknown webpages. Moreover, in Experiment (C), the incremental learning technique was used in combination with the weighted sliding window to store the recurring keywords,which would help improve the effectiveness of identifying pornographic webpages by giving greater weights to the webpages with recurring keywords. Therefore, the F-measure of Experiment (C) was the highest among these three experiments, and it reached the highest value of 98.34% in Month (IV). Hence, incremental learning concept drift can effectively help the classification of unknown webpages.

    Table 7: F-measure of the three experiments

    5.Conclusion

    In this paper, we used the decision tree data mining technique to track the concept drift of pornographic webpages.Pornographic webpages can easily change with the real world to produce new information to generate concept drift. To allow the filtering method proposed in this paper to suit the dynamic environment and improve its accuracy and performance, we proposed the weighted sliding window to store the recurring keywords, which would help evaluate the concept drift condition of unknown webpages. And we designed an incremental learning mechanism to learn newly found pornographic keywords, which would substantially contribute to the identification of pornographic webpages. According to the experimental results, our method coupled with the incremental learning technique and detection of concept drift had the accuracy rate up to 98.33% in the actual classification of pornographic webpages.

    The proposed webpage filter in this paper can only filter English webpages. Due to the development of the Internet,pornographic webpage information is increasingly internationalized and diversified. Therefore, we suggest that the future development direction is the development of filters that can identify pornographic webpages of multiple languages such as Chinese, Japanese, and Korean.

    [1]W. P. Stol, H. K. W. Kaspersen, J. Kerstens, E. R. Leukfeldt,and A. R. Lodder, “Governmental filtering of websites: The Dutch case,”Computer Law & Security Review, vol. 25, no.3, pp. 251-262, 2009.

    [2]B. H. Schell, M. V. Martin, P. C. Hung, and L. Rueda,“Cyber child pornography: A review paper of the social and legal issues and remedies—and a proposed technological solution,”Aggression and Violent Behavior, vol. 12, no. 1,pp. 45-63, 2007.

    [3]Z. Yan, “Differences in high school and college students’basic knowledge and perceived education of Internet safety:Do high school students really benefit from the children’s Internet protection act?”Journal of Applied Developmental Psychology, vol. 30, no. 3, pp. 209-217, 2009.

    [4]C. H. Chou, A. P. Sinha, and H. Zhao, “Commercial Internet filters: Perils and opportunities,”Decision Support Systems,vol. 48, no. 4, pp. 521-530, 2010.

    [5]M. L. Ybarra, D. Finkelhor, K. J. Mitchell, and J. Wolak,“Associations between blocking, monitoring, and filtering software on the home computer and youth-reported unwanted exposure to sexual material online,”Child Abuse& Neglect, vol. 33, no. 12, pp. 857-869, 2009.

    [6]Q. Li, J.-H. Li, G.-S. Liu, and S.-H. Li, “A rough set-based hybrid feature selection method for topic-specific text filtering,” inProc. of IEEE Intl. Conf. on Machine Learning and Cybernetics, 2004, pp. 1464-1468.

    [7]J. Polpinij, C. Sibunruang, S. Paungpronpitag, R.Chamchong, and A. Chotthanom, “A web pornography patrol system by content-based analysis: In particular text and image,” inProc. of the SMC IEEE Intl. Conf. on Systems,Man and Cybernetics, 2008, pp. 500-505.

    [8]J. Liu, X. Li, and W. Zhong, “Ambiguous decision trees for mining concept-drifting data streams,”Pattern Recognition Letters, vol. 30, no. 15, pp. 1347-1355, 2009.

    [9]P. Y. Lee, S. C. Hui, and A. C. M. Fong, “An intelligent categorization engine for bilingual web content filtering,”IEEE Trans. on Multimedia, vol. 7, no. 6, pp. 1183-1190,2005.

    [10]Y. Yang, “An evaluation of statistical approaches to text categorization,”Information Retrieval, vol. 1, no. 1-2, pp.69-90, 1999.

    [11]L. H. Lee and C. J. Luh, “Generation of pornographic blacklist and its incremental update using an inverse chisquare based method,”InformationProcessing&Management, vol. 44, no. 5, pp. 1698-1706, 2008.

    [12]A. Ahmadi, M. Fotouhi, and M. Khaleghi, “Intelligent classification of web pages using contextual and visual features,”Applied Soft Computing, vol. 11, no. 2, pp. 1638-1647, 2011.

    [13]H. Ma, “Fast blocking of undesirable web pages on client PC by discriminating URL using neural networks,”Expert Systems with Applications, vol. 34, no. 2, pp. 1533-1540,2008.

    [14]D. Li, N. Li, J. Wang, and T. Zhu, “Pornographic images recognition based on spatial pyramid partition and multiinstance ensemble learning,”Knowledge-Based Systems, vol.84, pp. 214-223, Aug. 2015.

    [15]T. M. Mahmoud, T. Abd-El-Hafeez, and A. Omar, “An efficient system for blocking pornography websites,” inComputer Vision and Image Processing in Intelligent SystemsandMultimediaTechnologies, Information Resources Management Association, 2014.

    [16]J. Zhang, L. Sui, L. Zhuo, Z. Li, and Y. Yang, “An approach of bag-of-words based on visual attention model for pornographic images recognition in compressed domain,”Neurocomputing, vol. 110, no. 8, pp. 145-152, 2013.

    [17]L. Zhuo, J. Zhang, Y. Zhao, and S. Zhao, “Compressed domain based pornographic image recognition using multicost sensitive decision trees,”Signal Processing, vol. 93, no.8, pp. 2126-2139, 2013.

    [18]E. Georgiou, M. D. Dikaiakos, and A. Stassopoulou, “On the properties of spam-advertised URL addresses,”Journal of Network and Computer Applications, vol. 31, no. 4, pp. 966-985, 2008.

    [19]F. Fdez-Riverola, E. L. Iglesias, F, Díaz, J. R. Méndez, and J.M. Corchado, “Applying lazy learning algorithms to tackle concept drift in spam filtering,”Expert Systems with Applications, vol. 33, no. 1, pp. 36-48, 2007.

    [20]G. Widmer and M Kubat, “Learning in the presence of concept drift and hidden contexts,”Machine Learning, vol.23, no. 1, pp. 69-101, 1996.

    [21]I. Koychev and R. Lothian, “Tracking drifting concepts by time window optimization,” inProc. of Research and Development in Intelligent Systems XXII, 2006, pp. 46-59.

    [22]M. M. Lazarescu, S. Venkatesh, and H. H. Bui, “Using multiple windows to track concept drift,”Intelligent Data Analysis, vol. 8, no. 1, pp. 29-59, 2004.

    [23]G. Widmer and M Kubat, “Learning in the presence of concept drift and hidden contexts,”Machine Learning, vol.23, no. 1, pp. 69-101, 1996.

    [24]R. Klinkenberg, “Learning drifting concepts: Example selection vs. example weighting,”Intelligent Data Analysis,vol. 8, no. 3, pp. 281-300, 2004.

    [25]M. Salganicoff, “Tolerating concept and sampling shift in lazy learning using prediction error context switching,”Artificial Intelligence Review, vol. 11, no. 1-5, pp. 133-155,1997.

    [26]J. R. Quinlan, “Induction of decision trees,”Machine Learning, vol. 1, no. 1, pp. 81-106, 1986.

    [27]J. R. Quinlan,C4.5: Programs for Machine Learning,Morgan Kaufmann, 1993.

    [28]M. F. Porter, “An algorithm for suffix stripping,”Program,vol. 14, no. 3, pp. 130-137, 1980.

    [29]I. Androutsopoulos, J. Koutsias, K. V. Chandrinos, G.Paliouras, and C. D. Spyropoulos, “An evaluation of naive Bayesian anti-spam filtering,” inProc. of the Workshop onMachine Learning in the New Information Age,the 11th European Conf. on Machine Learning, 2000, pp. 9-17.

    x7x7x7水蜜桃| 国产成人福利小说| 国产私拍福利视频在线观看| 午夜免费观看网址| 欧美午夜高清在线| 黄片小视频在线播放| 欧美大码av| 国产在线精品亚洲第一网站| 亚洲精品一卡2卡三卡4卡5卡| 日本五十路高清| 亚洲av免费在线观看| 中亚洲国语对白在线视频| 亚洲欧美精品综合久久99| 在线观看舔阴道视频| 18禁观看日本| 国产亚洲欧美在线一区二区| av女优亚洲男人天堂 | 国内精品一区二区在线观看| 欧美在线一区亚洲| 久9热在线精品视频| 成年免费大片在线观看| 最近最新中文字幕大全电影3| 色综合婷婷激情| 亚洲欧美日韩东京热| 不卡一级毛片| 午夜视频精品福利| 91麻豆精品激情在线观看国产| 国产精品av久久久久免费| 青草久久国产| 欧美另类亚洲清纯唯美| 欧美日韩国产亚洲二区| 1000部很黄的大片| 日本 av在线| 麻豆国产97在线/欧美| 岛国视频午夜一区免费看| 淫秽高清视频在线观看| 成人午夜高清在线视频| 俺也久久电影网| 一级作爱视频免费观看| 一级作爱视频免费观看| 亚洲第一欧美日韩一区二区三区| 亚洲男人的天堂狠狠| 一级毛片女人18水好多| 老司机深夜福利视频在线观看| 成年版毛片免费区| 国产乱人视频| 国产三级在线视频| 嫩草影院精品99| 这个男人来自地球电影免费观看| 久久草成人影院| 两性午夜刺激爽爽歪歪视频在线观看| 在线观看一区二区三区| 日本 欧美在线| 成人18禁在线播放| 国产精品亚洲一级av第二区| 美女黄网站色视频| 日韩有码中文字幕| 国产精品亚洲美女久久久| 亚洲精品在线观看二区| 精品日产1卡2卡| 精品福利观看| 757午夜福利合集在线观看| 在线a可以看的网站| 91字幕亚洲| 国产主播在线观看一区二区| 欧美性猛交╳xxx乱大交人| a在线观看视频网站| 亚洲人与动物交配视频| 欧美另类亚洲清纯唯美| 脱女人内裤的视频| 成人高潮视频无遮挡免费网站| 亚洲 欧美 日韩 在线 免费| 国产男靠女视频免费网站| 国产蜜桃级精品一区二区三区| av在线天堂中文字幕| 熟女人妻精品中文字幕| 超碰成人久久| 一进一出好大好爽视频| 国产美女午夜福利| 亚洲一区二区三区不卡视频| 99久久精品热视频| 亚洲欧美日韩高清专用| 国产精品亚洲美女久久久| 丁香欧美五月| 日本一二三区视频观看| 少妇的逼水好多| av天堂在线播放| 黄频高清免费视频| 成人18禁在线播放| 精品电影一区二区在线| 国产黄色小视频在线观看| 久久久久国产一级毛片高清牌| 日韩精品中文字幕看吧| 97超视频在线观看视频| 国内精品久久久久久久电影| 国语自产精品视频在线第100页| 99久久精品热视频| 亚洲成人久久爱视频| netflix在线观看网站| 日本与韩国留学比较| 少妇裸体淫交视频免费看高清| 国产成人欧美在线观看| 亚洲中文字幕日韩| 淫秽高清视频在线观看| 日本三级黄在线观看| 午夜两性在线视频| 淫秽高清视频在线观看| 国产成人欧美在线观看| 欧美三级亚洲精品| 免费大片18禁| 天堂影院成人在线观看| 国语自产精品视频在线第100页| 亚洲人成网站在线播放欧美日韩| 很黄的视频免费| 在线观看日韩欧美| 欧美一级毛片孕妇| 日本在线视频免费播放| 一级毛片高清免费大全| 久久精品91蜜桃| 99re在线观看精品视频| 俄罗斯特黄特色一大片| 最近在线观看免费完整版| 熟女少妇亚洲综合色aaa.| 波多野结衣巨乳人妻| 熟女人妻精品中文字幕| 在线播放国产精品三级| 91九色精品人成在线观看| 人妻夜夜爽99麻豆av| 黄色女人牲交| 美女 人体艺术 gogo| 国产伦一二天堂av在线观看| 美女黄网站色视频| 亚洲一区高清亚洲精品| 成人特级黄色片久久久久久久| 久久精品影院6| 日本撒尿小便嘘嘘汇集6| www日本在线高清视频| 村上凉子中文字幕在线| 国产高清激情床上av| 精品99又大又爽又粗少妇毛片 | 日本免费a在线| 久久久国产成人免费| 真实男女啪啪啪动态图| 一个人看的www免费观看视频| 亚洲精品在线观看二区| 久久香蕉国产精品| 后天国语完整版免费观看| 国产综合懂色| 亚洲精品一卡2卡三卡4卡5卡| 国产高清视频在线播放一区| 久久精品国产亚洲av香蕉五月| 亚洲18禁久久av| 俄罗斯特黄特色一大片| 欧美色视频一区免费| xxxwww97欧美| 欧洲精品卡2卡3卡4卡5卡区| 中文字幕av在线有码专区| 亚洲国产高清在线一区二区三| av国产免费在线观看| 久久久水蜜桃国产精品网| 久久亚洲真实| 女人被狂操c到高潮| 日日夜夜操网爽| 日韩中文字幕欧美一区二区| 亚洲片人在线观看| 黄频高清免费视频| 国产视频内射| 在线国产一区二区在线| 每晚都被弄得嗷嗷叫到高潮| 男人舔女人下体高潮全视频| 日本 欧美在线| 脱女人内裤的视频| 国产蜜桃级精品一区二区三区| 在线观看日韩欧美| 激情在线观看视频在线高清| 日本精品一区二区三区蜜桃| 欧美极品一区二区三区四区| 欧美+亚洲+日韩+国产| 亚洲七黄色美女视频| 国产又黄又爽又无遮挡在线| 少妇人妻一区二区三区视频| 国产淫片久久久久久久久 | 欧美日韩一级在线毛片| 女同久久另类99精品国产91| 日本免费a在线| 最新美女视频免费是黄的| 亚洲 国产 在线| 久久久久久久精品吃奶| 久久国产精品人妻蜜桃| 欧美在线黄色| 非洲黑人性xxxx精品又粗又长| 精品福利观看| 天天添夜夜摸| 精品一区二区三区av网在线观看| 久久人人精品亚洲av| 俺也久久电影网| 9191精品国产免费久久| 久久久成人免费电影| 在线免费观看不下载黄p国产 | 青草久久国产| 网址你懂的国产日韩在线| 日韩三级视频一区二区三区| 精品久久久久久久久久久久久| 大型黄色视频在线免费观看| 亚洲五月婷婷丁香| 特级一级黄色大片| 久久久国产精品麻豆| 日韩欧美在线二视频| 日韩欧美 国产精品| 亚洲七黄色美女视频| 中文字幕久久专区| 一区福利在线观看| 国产69精品久久久久777片 | 久久久久国产一级毛片高清牌| 色哟哟哟哟哟哟| 18禁美女被吸乳视频| 一级毛片女人18水好多| av欧美777| 熟女人妻精品中文字幕| 亚洲欧美精品综合一区二区三区| 精品国产乱码久久久久久男人| 国产在线精品亚洲第一网站| 国产伦精品一区二区三区视频9 | 亚洲天堂国产精品一区在线| 少妇丰满av| 亚洲人与动物交配视频| 不卡一级毛片| 啪啪无遮挡十八禁网站| 亚洲av成人一区二区三| 国产黄a三级三级三级人| 国产激情久久老熟女| 欧美+亚洲+日韩+国产| 免费看十八禁软件| 欧美激情久久久久久爽电影| 成在线人永久免费视频| 日日摸夜夜添夜夜添小说| 日本 av在线| 免费在线观看成人毛片| 午夜福利高清视频| 精品欧美国产一区二区三| 天天一区二区日本电影三级| 女生性感内裤真人,穿戴方法视频| 午夜成年电影在线免费观看| 欧美av亚洲av综合av国产av| 亚洲人成电影免费在线| 国产精品99久久99久久久不卡| 午夜福利免费观看在线| 中文字幕久久专区| 欧美黄色片欧美黄色片| 国产高清videossex| 亚洲精品一区av在线观看| 国产精华一区二区三区| 婷婷亚洲欧美| 搡老妇女老女人老熟妇| 韩国av一区二区三区四区| 深夜精品福利| 中文字幕最新亚洲高清| 久久亚洲精品不卡| 亚洲欧美精品综合久久99| 国产人伦9x9x在线观看| 成人三级黄色视频| 国产成人aa在线观看| 又紧又爽又黄一区二区| 天天躁日日操中文字幕| 日韩国内少妇激情av| 国产成人福利小说| 中文字幕久久专区| 99精品欧美一区二区三区四区| 老司机福利观看| 大型黄色视频在线免费观看| 久久天躁狠狠躁夜夜2o2o| 亚洲一区二区三区不卡视频| 噜噜噜噜噜久久久久久91| 精品久久久久久久久久免费视频| 久久精品国产清高在天天线| 亚洲男人的天堂狠狠| 日韩人妻高清精品专区| 欧美色视频一区免费| 免费av不卡在线播放| 视频区欧美日本亚洲| 中文在线观看免费www的网站| 午夜福利18| 亚洲国产色片| 身体一侧抽搐| 亚洲精品久久国产高清桃花| 国产黄片美女视频| 啪啪无遮挡十八禁网站| 又黄又爽又免费观看的视频| 91在线精品国自产拍蜜月 | 最好的美女福利视频网| 久久这里只有精品19| 久久精品91蜜桃| 母亲3免费完整高清在线观看| 中文资源天堂在线| 国产一区二区三区在线臀色熟女| 亚洲av中文字字幕乱码综合| 亚洲中文av在线| 久久热在线av| 国产精品,欧美在线| 特大巨黑吊av在线直播| 搡老岳熟女国产| 99久久精品国产亚洲精品| 麻豆久久精品国产亚洲av| 丝袜人妻中文字幕| 又紧又爽又黄一区二区| 这个男人来自地球电影免费观看| 小说图片视频综合网站| 日韩高清综合在线| 小说图片视频综合网站| 又大又爽又粗| 女同久久另类99精品国产91| a级毛片在线看网站| 天天一区二区日本电影三级| 男女之事视频高清在线观看| 熟妇人妻久久中文字幕3abv| 我要搜黄色片| 搞女人的毛片| 男女之事视频高清在线观看| 亚洲va日本ⅴa欧美va伊人久久| 亚洲性夜色夜夜综合| 国内久久婷婷六月综合欲色啪| 大型黄色视频在线免费观看| 九九热线精品视视频播放| 天堂√8在线中文| 久久久水蜜桃国产精品网| 亚洲天堂国产精品一区在线| 亚洲乱码一区二区免费版| 久久天躁狠狠躁夜夜2o2o| 欧美日本视频| 草草在线视频免费看| 久久这里只有精品19| 午夜两性在线视频| 91在线精品国自产拍蜜月 | 国产精品美女特级片免费视频播放器 | 中文字幕久久专区| 免费看a级黄色片| 一个人免费在线观看的高清视频| 久久精品国产99精品国产亚洲性色| h日本视频在线播放| 露出奶头的视频| 亚洲av电影不卡..在线观看| 亚洲人成网站在线播放欧美日韩| 国产一区二区激情短视频| 久久久国产成人精品二区| 国产毛片a区久久久久| 亚洲av美国av| 欧美黄色淫秽网站| 国产精品一区二区精品视频观看| 国产高清视频在线观看网站| 欧美中文日本在线观看视频| 国产亚洲精品久久久久久毛片| 亚洲精品国产精品久久久不卡| 成年女人毛片免费观看观看9| 两个人的视频大全免费| 国产精品爽爽va在线观看网站| 国产97色在线日韩免费| 国产精品98久久久久久宅男小说| 亚洲九九香蕉| 免费在线观看成人毛片| 久久久久国产精品人妻aⅴ院| 久久天堂一区二区三区四区| 国产麻豆成人av免费视频| 在线十欧美十亚洲十日本专区| 国产精品,欧美在线| 在线看三级毛片| 麻豆成人av在线观看| 变态另类丝袜制服| 精品久久蜜臀av无| 日韩中文字幕欧美一区二区| or卡值多少钱| 午夜成年电影在线免费观看| www.自偷自拍.com| 天天躁日日操中文字幕| 看片在线看免费视频| 丰满的人妻完整版| 精品熟女少妇八av免费久了| 又黄又爽又免费观看的视频| 国产高清有码在线观看视频| 国产精品98久久久久久宅男小说| 一本久久中文字幕| 免费在线观看影片大全网站| 18禁黄网站禁片午夜丰满| 嫩草影视91久久| 亚洲欧美激情综合另类| 国产成人系列免费观看| 老司机福利观看| 国产精品香港三级国产av潘金莲| 黄色丝袜av网址大全| 国产欧美日韩一区二区三| 制服人妻中文乱码| 亚洲精品美女久久av网站| 国产探花在线观看一区二区| a级毛片a级免费在线| 欧美日本视频| 国产成人精品久久二区二区91| 白带黄色成豆腐渣| 国产成人影院久久av| 欧美三级亚洲精品| 亚洲人成电影免费在线| 日本与韩国留学比较| 精品久久蜜臀av无| 国产免费av片在线观看野外av| 亚洲第一电影网av| 十八禁网站免费在线| 中文字幕久久专区| 嫩草影院精品99| 又黄又粗又硬又大视频| 亚洲av熟女| 免费av不卡在线播放| 桃红色精品国产亚洲av| 久久久久久人人人人人| 久久这里只有精品19| 久久人人精品亚洲av| 特大巨黑吊av在线直播| 久久天堂一区二区三区四区| 欧美最黄视频在线播放免费| 成在线人永久免费视频| 国产精品国产高清国产av| 99久久无色码亚洲精品果冻| 全区人妻精品视频| 女警被强在线播放| 少妇人妻一区二区三区视频| 欧美国产日韩亚洲一区| 深夜精品福利| 色综合婷婷激情| 日本免费a在线| 欧美不卡视频在线免费观看| 俺也久久电影网| 我的老师免费观看完整版| 在线观看免费午夜福利视频| 色在线成人网| 色尼玛亚洲综合影院| 99精品欧美一区二区三区四区| 国产欧美日韩精品一区二区| 叶爱在线成人免费视频播放| 国产精品久久久人人做人人爽| 天堂影院成人在线观看| 亚洲精品国产精品久久久不卡| 91在线观看av| 欧美在线一区亚洲| 国产一级毛片七仙女欲春2| bbb黄色大片| 亚洲欧美日韩无卡精品| 伦理电影免费视频| 19禁男女啪啪无遮挡网站| 亚洲国产日韩欧美精品在线观看 | x7x7x7水蜜桃| 亚洲国产看品久久| 日韩欧美在线二视频| 久久天堂一区二区三区四区| 99久久精品一区二区三区| 99国产综合亚洲精品| 老熟妇乱子伦视频在线观看| 毛片女人毛片| 老熟妇仑乱视频hdxx| 夜夜夜夜夜久久久久| 99re在线观看精品视频| 国产在线精品亚洲第一网站| 嫩草影院精品99| 国产精品国产高清国产av| 嫁个100分男人电影在线观看| 99久久久亚洲精品蜜臀av| 老司机午夜十八禁免费视频| 色噜噜av男人的天堂激情| 色哟哟哟哟哟哟| tocl精华| 欧美+亚洲+日韩+国产| 美女高潮的动态| 国产高清激情床上av| 亚洲av电影不卡..在线观看| 国产精品一区二区三区四区久久| 欧美日本视频| 午夜福利在线观看吧| 色哟哟哟哟哟哟| e午夜精品久久久久久久| 一级a爱片免费观看的视频| 久久伊人香网站| 亚洲熟妇中文字幕五十中出| 国产成+人综合+亚洲专区| 亚洲国产欧美一区二区综合| 麻豆久久精品国产亚洲av| xxxwww97欧美| 国产欧美日韩一区二区三| 99久久精品一区二区三区| 一夜夜www| 99视频精品全部免费 在线 | 久久这里只有精品中国| 日日夜夜操网爽| 午夜亚洲福利在线播放| 日韩中文字幕欧美一区二区| 久久久久性生活片| 男女做爰动态图高潮gif福利片| 免费在线观看日本一区| 日本免费a在线| 99视频精品全部免费 在线 | 九九久久精品国产亚洲av麻豆 | 免费电影在线观看免费观看| 9191精品国产免费久久| 欧美在线一区亚洲| 黄色日韩在线| 18美女黄网站色大片免费观看| 国内精品美女久久久久久| 97超级碰碰碰精品色视频在线观看| 午夜福利在线在线| 亚洲一区高清亚洲精品| 99久久精品热视频| 色综合婷婷激情| 岛国在线免费视频观看| 国产视频一区二区在线看| 国产精品美女特级片免费视频播放器 | 别揉我奶头~嗯~啊~动态视频| 成人三级黄色视频| 夜夜躁狠狠躁天天躁| 国产精品女同一区二区软件 | 两个人看的免费小视频| 国产极品精品免费视频能看的| 亚洲成av人片免费观看| 每晚都被弄得嗷嗷叫到高潮| 女警被强在线播放| 神马国产精品三级电影在线观看| 在线免费观看不下载黄p国产 | 亚洲九九香蕉| 国产黄片美女视频| 久久午夜亚洲精品久久| 男人舔女人的私密视频| www国产在线视频色| 男女做爰动态图高潮gif福利片| 蜜桃久久精品国产亚洲av| 国产精品,欧美在线| 脱女人内裤的视频| 中文字幕熟女人妻在线| 天天一区二区日本电影三级| 成人无遮挡网站| 国产精品98久久久久久宅男小说| 日本一二三区视频观看| 亚洲精品在线美女| 精品熟女少妇八av免费久了| 午夜影院日韩av| 国内久久婷婷六月综合欲色啪| 久久久久久久久久黄片| 天堂av国产一区二区熟女人妻| 叶爱在线成人免费视频播放| 国内精品一区二区在线观看| 国产精品 国内视频| 一区二区三区激情视频| 欧美日韩一级在线毛片| 日韩成人在线观看一区二区三区| 欧美中文日本在线观看视频| 国产伦精品一区二区三区视频9 | 亚洲男人的天堂狠狠| 18禁国产床啪视频网站| 两个人看的免费小视频| 亚洲精品美女久久av网站| 一区二区三区国产精品乱码| 久久中文字幕人妻熟女| 老司机深夜福利视频在线观看| 欧美zozozo另类| av福利片在线观看| 久久久久久久精品吃奶| 亚洲色图av天堂| 成人无遮挡网站| 国产极品精品免费视频能看的| tocl精华| 好男人电影高清在线观看| x7x7x7水蜜桃| 搡老岳熟女国产| 色尼玛亚洲综合影院| 欧美黑人欧美精品刺激| 日日摸夜夜添夜夜添小说| 成在线人永久免费视频| 亚洲欧美日韩东京热| 亚洲国产欧美一区二区综合| 麻豆成人av在线观看| 男人和女人高潮做爰伦理| 国产乱人视频| 国产精品亚洲av一区麻豆| 午夜福利欧美成人| 成人亚洲精品av一区二区| 91麻豆精品激情在线观看国产| 亚洲人成网站高清观看| 国产一区二区激情短视频| 日韩国内少妇激情av| 日韩有码中文字幕| 91麻豆精品激情在线观看国产| 搞女人的毛片| 国产美女午夜福利| 久久中文看片网| 在线十欧美十亚洲十日本专区| 18禁黄网站禁片午夜丰满| 免费电影在线观看免费观看| 亚洲最大成人中文| 在线免费观看不下载黄p国产 | 好看av亚洲va欧美ⅴa在| 久久久久九九精品影院| 国产一区二区在线观看日韩 | 免费av不卡在线播放| 美女高潮的动态| 国产黄a三级三级三级人| 又紧又爽又黄一区二区| 在线观看免费午夜福利视频| 无遮挡黄片免费观看| 亚洲精品乱码久久久v下载方式 | 十八禁网站免费在线| 一本综合久久免费| 一个人观看的视频www高清免费观看 | 欧美三级亚洲精品| 国产成人一区二区三区免费视频网站| 日韩欧美精品v在线| 国产高清videossex| 亚洲国产欧美人成| 欧美精品啪啪一区二区三区| 免费观看的影片在线观看| 亚洲av成人不卡在线观看播放网| 校园春色视频在线观看| 在线免费观看的www视频|