Page time cheating screening method and device, electronic equipment and medium

By matching the page's time attribute with preset cheating methods, cheating pages can be identified and filtered out, thus solving the problem of page cheating affecting the healthy development of the Internet and improving search engines and user experience.

CN115146201BActive Publication Date: 2025-11-28BEIJING BAIDU NETCOM SCI & TECH CO LTD
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
CN202210772656.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-06-30
Publication Date
2025-11-28
Estimated Expiration
2042-06-30

AI Technical Summary

Technical Problem

Page cheating affects the healthy development of the Internet and user experience, and existing technologies are insufficient to efficiently filter out cheating pages.

Method used

By obtaining the source file data and time points of the page to be identified, the page's publication time, update time, and content time are determined. The time attributes are matched with preset cheating methods to identify time anomalies and filter out cheating pages.

Benefits of technology

It enables efficient filtering of cheating pages, improving the accuracy of the search engine and the user experience.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115146201B_ABST
    Figure CN115146201B_ABST
Patent Text Reader

Abstract

The present disclosure provides a page time cheating screening method, and relates to the technical field of information processing. The implementation scheme is: obtaining source file data used for generating a to-be-identified page and a first time, wherein the first time is a time point when the source file data is obtained; determining, based on the source file data, a second time corresponding to the to-be-identified page and a time attribute corresponding to the second time, wherein the second time includes at least one of the following: a page publishing time, a page updating time, and a time corresponding to content described by the page, and the time attribute includes a dynamic time and a static time; in response to determining that the time attribute is the static time, matching the first time and the second time with a preset time cheating mode, wherein the time cheating mode includes that the second time and the first time do not conform to a normal time distribution; and determining, based on a matching result, whether the to-be-identified page is a cheating page.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of information processing, and particularly relates to a page time cheating screening method and device, electronic equipment, computer readable storage medium and computer program product. BACKGROUND

[0002] Page cheating refers to a phenomenon that a web page cheats search engines or push engines to obtain a higher ranking. Page cheating is not conducive to the healthy development of the Internet and affects the network experience of users.

[0003] The methods described in this section can not necessarily be the methods previously conceived or adopted. Unless otherwise indicated, nothing in this section should be assumed to be prior art merely because it is included in this section. Similarly, unless otherwise indicated, matters discussed in this section should not be assumed to be prior to the application. SUMMARY

[0004] The present disclosure provides a page time cheating screening method and device, electronic equipment, computer readable storage medium and computer program product.

[0005] According to an aspect of the present disclosure, a page time cheating screening method is provided, comprising: obtaining source file data used to generate a to-be-identified page and a first time, wherein the first time is a time point when the source file data is obtained; determining, based on the source file data, a second time corresponding to the to-be-identified page and a time attribute corresponding to the second time, wherein the second time comprises at least one of the following: a page publishing time, a page updating time, and a time corresponding to content described by the page, and the time attribute comprises a dynamic time and a static time; in response to determining that the time attribute is a static time, matching the first time and the second time with a preset time cheating mode, wherein the time cheating mode comprises that the second time and the first time do not conform to a normal time distribution; and determining, based on a matching result, whether the to-be-identified page is a cheating page.

[0006] According to another aspect of the present disclosure, there is provided a page time cheating screening apparatus, comprising: a first acquisition unit configured to acquire source file data used to generate a to-be-identified page and a first time, wherein the first time is a time point when the source file data is acquired; a first determination unit configured to determine, based on the source file data, a second time corresponding to the to-be-identified page and a time attribute corresponding to the second time, wherein the second time comprises at least one of a page publishing time, a page updating time, and a time corresponding to content described by the page, and the time attribute comprises a dynamic time and a static time; a matching unit configured to, in response to determining that the time attribute is the static time, match the first time and the second time with a preset time cheating mode, wherein the time cheating mode comprises that the second time and the first time do not conform to a normal time distribution; and a second determination unit configured to determine, based on a matching result, whether the to-be-identified page is a cheating page.

[0007] According to another aspect of the present disclosure, there is provided an electronic device, comprising: at least one processor; and a memory communicatively connected with the at least one processor; the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform page time cheating screening.

[0008] According to another aspect of the present disclosure, there is provided a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform page time cheating screening.

[0009] According to another aspect of the present disclosure, there is provided a computer program product comprising a computer program which, when executed by a processor, implements page time cheating screening.

[0010] According to one or more embodiments of the present disclosure, by acquiring a time element of a to-be-identified page and matching it with a preset cheating mode to determine whether there is a time anomaly, an efficient page screening effect is achieved.

[0011] It should be understood that the content described in this section is not intended to identify key or important features of the embodiments of the present disclosure, nor is it used to limit the scope of the present disclosure. Other features of the present disclosure will become apparent through the following description. BRIEF DESCRIPTION OF DRAWINGS

[0012] The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain exemplary implementations of the application. The illustrated embodiments are merely examples and do not limit the scope of the claims. In all the drawings, like reference numerals refer to like elements throughout the accompanying drawings.

[0013] Figure 1 A schematic diagram illustrating an exemplary system in which various methods described herein can be implemented according to embodiments of the present disclosure is shown;

[0014] Figure 2 A flowchart of a page time cheating screening method according to embodiments of the present disclosure is shown;

[0015] Figure 3 An example of source file data according to embodiments of the present disclosure is shown;

[0016] Figure 4 Another example of source file data according to embodiments of the present disclosure is shown;

[0017] Figure 5 A block diagram of a structure of a page time cheating screening apparatus according to embodiments of the present disclosure is shown; and

[0018] Figure 6 A block diagram of a structure of an exemplary electronic device that can be used to implement embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0019] Exemplary embodiments of the present disclosure are described below with reference to the accompanying drawings, which include various details of the embodiments of the present disclosure to help the understanding of the present disclosure. These should be considered in the context of the overall description and they are not intended to limit the scope of the present disclosure, which is described in the appended claims. Thus, those of ordinary skill in the art will recognize various changes and modifications of the embodiments described herein, which changes and modifications are not to be considered as a departure from the scope of the present disclosure. Also, for the sake of brevity and clarity, descriptions of well-known functions and constructions are omitted herein.

[0020] In the present disclosure, the terms "first", "second", and the like are used to describe various elements only and do not intend to limit the positional relationship, the chronological relationship, or the importance of the elements. In some examples, the first element and the second element can refer to the same instance of the element, and in some cases, based on the context of the description, they can also refer to different instances.

[0021] The terms used in the description of various described examples in the present disclosure are only for the purpose of describing particular examples and are not intended to be limiting. Unless specifically defined otherwise, an element that is not specifically defined can be one or more. In addition, the term "and / or" used in the present disclosure encompasses any one of the listed items and all possible combinations thereof.

[0022] Embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings.

[0023] Figure 1A schematic diagram illustrating an example system 100 in which various methods and apparatus described herein can be implemented in accordance with embodiments of the present disclosure is shown. Reference is made to Figure 1 The system 100 includes one or more client devices 101, 102, 103, 104, 105, and 106, a server 120, and one or more communication networks 110 coupling the one or more client devices to the server 120. The client devices 101, 102, 103, 104, 105, and 106 can be configured to execute one or more application programs.

[0024] In embodiments of the present disclosure, the server 120 can run one or more services or software applications that enable the performance of the methods of page time cheating screening.

[0025] In certain embodiments, the server 120 can also provide other services or software applications, which can include non-virtual environments and virtual environments. In certain embodiments, these services can be provided as web-based services or cloud services, for example, to users of the client devices 101, 102, 103, 104, 105, and / or 106 under a software as a service (SaaS) model.

[0026] In Figure 1 In the illustrated configuration, the server 120 can include one or more components that implement the functionality performed by the server 120. These components can include software components, hardware components, or a combination thereof, executable by one or more processors. Users operating the client devices 101, 102, 103, 104, 105, and / or 106 can in turn utilize one or more client application programs to interact with the server 120 to utilize the services provided by the components. It will be appreciated that various different system configurations are possible, which can vary from the system 100. Thus, Figure 1 The system 100 is one example of a system for implementing the various methods described herein and is not intended to be limiting.

[0027] A user can use a client device 101, 102, 103, 104, 105, and / or 106 to conduct screening for page time cheating. The client device can provide an interface that enables the user of the client device to interact with the client device. The client device can also output information to the user via the interface. Although Figure 1 Only six client devices are depicted, but one of skill in the art will appreciate that the present disclosure can support any number of client devices.

[0028] Client devices 101, 102, 103, 104, 105, and / or 106 can include various types of computer devices, such as portable handheld devices, general purpose computers (such as personal computers and laptop computers), workstation computers, wearable devices, smart screen devices, self-service kiosk devices, service robots, gaming systems, thin clients, various messaging devices, sensors or other sensing devices, and the like. These computer devices can run various types and versions of software applications and operating systems, such as MICROSOFT Windows, APPLE iOS, UNIX-like operating systems, Linux or Linux-like operating systems (such as GOOGLE Chrome OS); or including various mobile operating systems, such as MICROSOFT Windows Mobile OS, iOS, Windows Phone, Android. Portable handheld devices can include cellular telephones, smartphones, tablet computers, personal digital assistants (PDAs), and the like. Wearable devices can include head-mounted displays (such as smart glasses) and other devices. Gaming systems can include various handheld gaming devices, Internet-enabled gaming devices, and the like. Client devices are capable of executing a variety of different applications, such as various Internet-related applications, communication applications (such as email applications), short message service (SMS) applications, and can use various communication protocols.

[0029] Network 110 can be any type of network familiar to those skilled in the art that can support data communications using any of a variety of available protocols, including without limitation TCP / IP, SNA, IPX, etc. As examples, one or more of networks 110 can be a LAN, an Ethernet network, a Token Ring network, a WAN, the Internet, a virtual network, a virtual private network (VPN), an intranet, an extranet, a local area network (LAN), a wide area network (WAN), a wireless network, a public switched telephone network (PSTN), an infrared network, a wireless network (e.g., a Bluetooth network), and / or any combination of these and / or other networks.

[0030] Server 120 can include one or more general purpose computers, special purpose server computers (e.g., PC (personal computer) servers, UNIX servers, mid-range servers), blade servers, large mainframe computers, server clusters, or any other appropriate arrangement and / or combination. Server 120 can include one or more virtual machines running virtual operating systems, or other computing architectures involving virtualization (such as one or more flexible pools of logical storage devices that can be virtualized to maintain virtual storage devices for servers). In various embodiments, server 120 can run one or more services or software applications that provide the functionality described below.

[0031] The computing units in the server 120 can run one or more operating systems including any of the operating systems described above, as well as any commercially available server operating systems. Server 120 can also run any of a variety of additional server applications and / or mid-tier applications, including HTTP servers, FTP servers, CGI servers, JAVA servers, database servers, etc.

[0032] In some embodiments, the server 120 can include one or more applications to analyze and consolidate data feeds and / or event updates from users of the client devices 101, 102, 103, 104, 105, and 106. The server 120 can also include one or more applications to display the data feeds and / or real-time events via one or more display devices of the client devices 101, 102, 103, 104, 105, and 106.

[0033] In some embodiments, the server 120 can be a server of a distributed system, or a server combined with a blockchain. The server 120 can also be a cloud server, or an intelligent cloud computing server or intelligent cloud host with artificial intelligence technology. The cloud server is a host product in the cloud computing service system, to solve the defects of large management difficulty and weak business scalability in traditional physical host and virtual private server (VPS, Virtual Private Server) services.

[0034] The system 100 can also include one or more databases 130. In certain embodiments, these databases can be used to store data and other information. For example, one or more of the databases 130 can be used to store information such as page data. The databases 130 can reside in a variety of locations. For example, databases used by the server 120 can reside locally to the server 120, or can be remote from the server 120 and can communicate with the server 120 via a network- or application-specific connection. The databases 130 can be of different types. In certain embodiments, databases used by the server 120 can be, for example, relational databases. One or more of these databases can store, update, and retrieve data to and from the databases in response to commands.

[0035] In certain embodiments, one or more of the databases 130 can also be used by applications to store application data. Databases used by applications can be different types of databases, such as key-value stores, object stores, or regular stores backed by file systems.

[0036] Figure 1The system 100 can be configured and operated in various ways to enable the application of various methods and apparatuses described according to the present disclosure.

[0037] In today's network environment, some sites modify their real content creation time in a cheating way in order to make their content more easily ranked in front of search, higher priority for message push. The cheating behavior of the website makes the user unable to get the expected information, seriously affecting the user experience.

[0038] Figure 2 is a flow chart of a page time cheating screening method according to an example embodiment of the present disclosure.

[0039] As shown in Figure 2 The method comprises the following steps: S201, acquiring source file data used to generate a to-be-identified page and a first time, wherein the first time is a time point when the source file data is acquired; S202, determining a second time corresponding to the to-be-identified page and a time attribute corresponding to the second time based on the source file data, wherein the second time comprises at least one of the following: a page publishing time, a page updating time, and a time corresponding to content described by the page, and the time attribute comprises a dynamic time and a static time; S203, in response to determining that the time attribute is a static time, matching the first time and the second time with a preset time cheating mode, wherein the time cheating mode comprises that the second time and the first time do not conform to a normal time distribution; and S204, determining whether the to-be-identified page is a cheating page based on a matching result.

[0040] According to an embodiment of the present disclosure, by acquiring the time element of the to-be-identified page and matching it with the preset cheating mode, it is determined whether there is a time anomaly, so as to achieve an efficient page screening effect.

[0041] In some examples, after the corresponding time is acquired, the time format thereof can be converted into a unified time format, such as a Unix timestamp, to facilitate subsequent time matching.

[0042] In the present disclosure, the source file refers to a plurality of source codes written by a designer in a webpage page making process through a computer language such as HTML, JavaScript, etc., each of the plurality of source codes corresponds to a different part of the page, the browser compiles the source codes and displays the compilation result in the browser interface, and finally forms the effect we see. The source code includes dynamic source code and static source code. Dynamic source code can change in response to interaction between the page and the user, for example, a personal mailbox can respond to receiving a new email by displaying the new email as unopened in the interface, and after the user opens the new email, the new email is displayed as opened. In addition, static source code does not change with the interaction between the page and the user, and generally remains unchanged, for example, the source code of a webpage news.

[0043] In the present disclosure, in the process of determining whether the page is cheating, the three times of page publishing time, page updating time, and the time corresponding to the content described by the page can be used for judgment. This is because search engines generally determine the priority pushing strategy based on the three times, and the page also corresponds to this search engine algorithm, and the three times are given priority to cheat. However, the time used for cheating screening in the present disclosure is not limited to this.

[0044] For step S201, for example, a program such as a web crawler can be used to automatically capture the source file of the page, thereby obtaining the source file data of the page to be identified, that is, the source code. At the same time, the web crawler also records the time point of implementing the capture behavior, that is, the first time.

[0045] For step S202, by analyzing the source file obtained by the web crawler, the information contained in the source file can be obtained, for example, a piece of source code in the source file corresponds to the page publishing time, and this piece of source code indicates when the page is published on the network. It can be understood that after the page is published on the network, the same page will not be republished under normal circumstances, and the page publishing time generally remains unchanged, so the source code corresponding to the page publishing time is usually static source code, that is, static time.

[0046] In some examples, the time data in the source file can be obtained based on a machine learning-based network model, or a specific data structure in the source file can be identified to obtain the time data, which is not limited herein.

[0047] For step S203, the time cheating mode includes at least one of the page publishing time, the page updating time, and the time corresponding to the content described by the page being later than the time point when the source file data is obtained, but is not limited to this.

[0048] According to some embodiments, the page time cheating screening method further comprises: obtaining a third time, wherein the third time is a time point when the to-be-identified page is discovered; and in response to determining that the third time is earlier than the first time, determining a second time corresponding to the to-be-identified page and a time attribute corresponding to the second time.

[0049] According to some embodiments, when a network crawler discovers a to-be-identified page, due to factors such as memory capacity or network bandwidth, the crawler cannot obtain the source file from the page in time, i.e., the time point when the page is discovered is inconsistent with the time point when the source file data is obtained. It can be understood that the time point when the page is discovered is earlier than the time point when the source file is obtained is a normal case, and the time point when the page is discovered is later than the time point when the source file is obtained is an abnormal case. In determining whether the to-be-identified page is a cheating page, firstly, the order between the time point when the page is discovered and the time point when the source file data is obtained is determined to exclude the case of data abnormality itself. In addition, in the normal case, subsequent cheating screening operations can be performed; and in the abnormal case, the source file obtained in the abnormal case can be cleaned to reobtain the source file after the abnormal case is eliminated.

[0050] According to some embodiments, the page time cheating screening method further comprises: in response to determining that the time attribute is a dynamic time, determining the to-be-identified page as a cheating page.

[0051] In the present disclosure, the dynamic time is that the time corresponding to the page can change constantly, e.g., changes with the crawling operation.

[0052] According to some embodiments, determining the time attribute corresponding to the second time comprises: obtaining source file data for generating the to-be-identified page multiple times to determine a corresponding second time after each time the source file data is obtained; and in response to determining that the corresponding second times obtained multiple times are inconsistent, determining the time attribute corresponding to the second time as a dynamic attribute.

[0053] In some embodiments, one cheating method of a page is to use a dynamic source code to write a source code of a page update time, e.g., to provide a link in the source code corresponding to the page update time. In this way, the page can update the latest access time as the page update time with the user's access.

[0054] According to some embodiments, the crawler crawls the same page multiple times and compares the time information in the source files obtained by multiple times of crawling. If the same type of time (e.g., the publication time) is inconsistent, it is determined that the page is cheating.

[0055] According to some embodiments, the time attribute corresponding to the second time is determined based on a trained model, wherein the model is trained based on feature data related to time information in the page source file data.

[0056] According to some embodiments, a pre-trained machine learning model is used to identify the source code related to the second time in the source file, and further identify whether the source code is dynamic or static, so as to determine the time attribute. For example, the machine learning model can be trained based on data ID, label, text, data structure and other features in the source file as sample data, so that the machine learning model can identify the time attribute corresponding to the second time in the source file.

[0057] It can be understood that other methods for identifying the time attribute corresponding to the second time, and methods for training the machine learning model are possible, and are not limited herein.

[0058] According to some embodiments, the page time cheating screening method further comprises: determining the page type of the page to be identified, wherein the page type comprises a list page and a content page, and wherein the time cheating manner further comprises: the change frequency of the second time is greater than a preset threshold value associated with the page type.

[0059] According to some embodiments, the page type comprises a list page, such as a portal website, a homepage of a news website, etc. The content page refers to a page displaying news content. Compared with the content page, the list page often changes the time of the page, and such change is normal, so as long as the change frequency does not exceed the preset threshold value, it is not considered cheating.

[0060] According to some embodiments, the second time comprises at least two of the following: page publishing time, page updating time, and time corresponding to the content described by the page, and the page to be identified comprises a plurality of pages to be identified in the same site, wherein the time cheating manner further comprises: the time difference between the second times corresponding to the plurality of pages to be identified is approximately equal.

[0061] In the present disclosure, "approximately equal" includes complete equality, equality within a certain threshold range, and stable change.

[0062] It can be understood that the cheating behavior aggregation occurs in the website page and a plurality of pages related to the website page. When performing page time cheating screening, the source file is obtained in the granularity of the entire site. The statistical granularity is not limited to the entire site, but can also be a directory or a single page.

[0063] According to some embodiments, the second time includes at least one of the page publication time and the page update time, and the time corresponding to the content described on the page. Furthermore, the time manipulation method further includes: the at least one of the page publication time and the page update time being later than the time corresponding to the content described on the page by a preset time period. According to this embodiment, the problem of "old news re-emerging" can be effectively prevented; for example, the page publication time or page update time is 2021, while the time corresponding to the content described on the page is 2018.

[0064] Figure 3 An example of source file data according to an embodiment of this disclosure is shown. Figure 3 As shown, the source code of this file includes: page publication time source code area 301, page update time source code area 302, and content time source code area 303 corresponding to the time of the content described on the page. By reading the source file, and specifically reading "publication time 2022-01-17 13:36" in page publication time source code area 301 (this is static source code), the page publication time can be obtained, and its time attribute is static. Reading "update time July 3, 2018" in page update time source code area 302 (this is static source code), the page update time can be obtained, and its time attribute is static. Reading "2018 National Social Security Latest Policy" in content time source code area 303 (this is static source code), the time corresponding to the content described on the page can be obtained, and its time attribute is static.

[0065] exist Figure 3 In the illustrated embodiment, the content described on the page corresponds to the year 2018, and the page was published in 2022. That is, the page was published after the time corresponding to the content described on the page, which is more than a preset time period (e.g., one month). It can be seen that the page is cheating by republishing old news, which can reduce the page's priority in search engine display.

[0066] Figure 4 Another example of source file data according to an embodiment of this disclosure is shown.

[0067] like Figure 4 As shown, in this source file, only source code section 401 is related to time. The "..." in source code section 401 <a id="js_time”href="javascript:;”>1652250602 The source code segment is identified by the significant characteristic of being dynamic source code, id="js_time", and is related to the second time. Therefore, the time attribute on this page is dynamic time. In response to determining that the time attribute is dynamic time, the page to be identified is determined to be a cheating page.

[0068] For step S204, it is determined whether the to-be-identified page is a cheating page based on the matching result. For example, if it is not matched with any time cheating manner, it is determined as cheating, for example, the page publishing time is later than the time point when the source file data is acquired.

[0069] According to some embodiments, the preset time cheating manners can be multiple. The determination of whether the to-be-identified page is a cheating page based on the matching result can include: determining whether the to-be-identified page is a cheating page based on the matched time cheating manners and their respective preset weight values.

[0070] For example, when the time cheating manners include the above-mentioned multiple time cheating manners, if multiple time cheating manners are matched, the calculation can be performed based on the weight values corresponding to each time cheating manner, for example: sigmoid(∑w*time_info), where time_info is the matched time cheating manner, and w is the respective corresponding weight value.

[0071] In some embodiments, the time cheating manner includes that the second time and the first time do not conform to the normal time distribution, and the second time is multiple, and the time cheating manner can be subdivided into which specific second time does not conform to the normal time distribution with the first time. For example, if the page publishing time, the page updating time, and the time corresponding to the content described by the page are all slightly later than the time point when the source file data is acquired (i.e., the first time), the time deviations corresponding to the three second times can be weighted and calculated respectively, so as to determine whether to cheat according to the result of the weighted calculation.

[0072] According to embodiments of the present disclosure, as shown in Figure 5 A page time cheating screening device 500 is also provided, which includes: a first acquisition unit 510 configured to acquire source file data used to generate a to-be-identified page and a first time, where the first time is a time point when the source file data is acquired; a first determination unit 520 configured to determine, based on the source file data, a second time corresponding to the to-be-identified page and a time attribute corresponding to the second time, where the second time includes at least one of the following: page publishing time, page updating time, and time corresponding to the content described by the page, and the time attribute includes dynamic time and static time; a matching unit 530 configured to, in response to determining that the time attribute is static time, match the first time and the second time with a preset time cheating manner, where the time cheating manner includes that the second time and the first time do not conform to the normal time distribution; and a second determination unit 540 configured to determine whether the to-be-identified page is a cheating page based on the matching result.

[0073] Here, the operations of the above-described units 510-540 of the page time cheating screening device 500 are similar to the operations of the above-described steps 210-240, respectively, and thus will not be described again here.

[0074] According to embodiments of the present disclosure, an electronic device, a readable storage medium, and a computer program product are also provided.

[0075] Reference Figure 6 A block diagram of an electronic device 600, which can be an example of a hardware device that can be used in aspects of the disclosure, will now be described. The electronic device is intended to represent various forms of digital electronic computing devices such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computing devices. The electronic device can also represent various forms of mobile devices such as personal digital processors, cellular telephones, smart phones, wearable devices, and other similar computing devices. The components shown here, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the present disclosure described and / or claimed in this document.

[0076] As Figure 6 shown, the electronic device 600 includes a computing unit 601 that can perform various appropriate actions and processes in accordance with a computer program stored in a read-only memory (ROM) 602 or a computer program loaded into a random access memory (RAM) 603 from a storage unit 608. Various programs and data required for the operation of the electronic device 600 can also be stored in the RAM 603. The computing unit 601, the ROM 602, and the RAM 603 are connected to each other through a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0077] A number of components in the electronic device 600 are connected to the I / O interface 605, including: an input unit 606, an output unit 607, a storage unit 608, and a communication unit 609. The input unit 606 can be any type of device capable of inputting information to the electronic device 600, which can receive inputted digital or character information, and generate key signal inputs related to user settings and / or function controls of the electronic device, and can include, but is not limited to, a mouse, a keyboard, a touch screen, a track pad, a track ball, a joystick, a microphone, and / or a remote control. The output unit 607 can be any type of device capable of presenting information, and can include, but is not limited to, a display, a speaker, a video / audio output terminal, a vibrator, and / or a printer. The storage unit 608 can include, but is not limited to, a magnetic disk, an optical disk. The communication unit 609 allows the electronic device 600 to exchange information / data with other devices through a computer network, such as the Internet, and / or various telecommunication networks, and can include, but is not limited to, a modem, a network card, an infrared communication device, a wireless communication transceiver, and / or a chipset, such as a Bluetooth™ device, an 802.11 device, a WiFi device, a WiMax device, a cellular communication device, and / or the like.

[0078] The computing unit 601 can be various general and / or special purpose processing components having processing and computing capabilities. Some examples of the computing unit 601 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various specialized artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The computing unit 601 performs various methods and processes described above, such as the method page time cheating screening. For example, in some embodiments, the method page time cheating screening can be implemented as a computer software program tangibly embodied in a machine-readable medium, such as the storage unit 608. In some embodiments, part or all of the computer program can be loaded and / or installed onto the electronic device 600 via the ROM 602 and / or the communication unit 609. When the computer program is loaded onto the RAM 603 and executed by the computing unit 601, one or more steps of the method page time cheating screening described above can be performed. Alternatively, in other embodiments, the computing unit 601 can be configured to perform the method page time cheating screening by any other appropriate means, such as by means of firmware.

[0079] The various embodiments of the systems and techniques described above can be implemented in digital electronic circuitry, integrated circuitry, a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), a system on a chip (SOC), a complex programmable logic device (CPLD), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include implementation in one or more computer programs that are executable and / or interpretable on a programmable system including at least one programmable processor, which can be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device.

[0080] Program code for carrying out methods of the present disclosure can be written in any combination of one or more programming languages. The program code can be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the program code, when executed by the processor or controller, produces the functions / operations specified in the flowcharts and / or the block diagrams. The program code can be executed entirely on a machine, partially on a machine, partially on a machine as a stand-alone software package, and partially on a remote machine or a server.

[0081] In the context of the present disclosure, a machine-readable medium can be a tangible medium that contains or stores a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include but is not limited to an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of the machine-readable storage medium will include one or more lines of electrical conductors, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0082] To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user and a keyboard and a pointing device (e.g., a mouse or a trackball) by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form, including acoustic, speech, or tactile input.

[0083] The systems and techniques described here can be implemented in a computing system that includes a back end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front end component (e.g., a user computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back end, middleware, or front end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network (LAN), a wide area network (WAN), the Internet, and a blockchain network.

[0084] The computer system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server is generally established by computer programs running on the respective computers and having a client-server relationship to each other. The servers can be cloud servers, servers of a distributed system, or servers combined with a blockchain.

[0085] It should be understood that the various forms of flow shown above can be re-ordered, added to, or deleted from without departing from the scope of the present disclosure. For example, the steps recited in the present disclosure can be performed in parallel, in series, or in a different order, as long as the desired results of the technology disclosed in the present disclosure are achieved, which is not limited herein.

[0086] While embodiments or examples of this disclosure have been described with reference to the figures, it will be understood that the methods, systems, and devices described above are merely exemplary embodiments or examples, and the scope of the application is not limited to these embodiments or examples. Various elements of the embodiments or examples can be omitted or substituted by equivalents thereof. Furthermore, the steps can be performed in a different order than described in the disclosure. Further, various elements of the embodiments or examples can be combined in various ways. It is important that as technology evolves, many of the elements described herein can be substituted by equivalents which serve the same function.

Claims

1. A method for page time cheating screening, comprising: obtaining source file data for generating a to-be-identified page and a first time, wherein the first time is a time point when the source file data is obtained; based on the source file data, determining a second time corresponding to the to-be-identified page and a time attribute corresponding to the second time, wherein the second time comprises at least one of a page publishing time, a page updating time, and a time corresponding to content described by the page, and the time attribute comprises a dynamic time and a static time, wherein determining the time attribute corresponding to the second time comprises: obtaining source file data for generating the to-be-identified page multiple times to determine a corresponding second time after each time the source file data is obtained; and in response to determining that the corresponding second times obtained multiple times are inconsistent, determining the time attribute corresponding to the second time as a dynamic attribute; in response to determining that the time attribute is a static time, matching the first time and the second time with a preset time cheating mode, wherein the time cheating mode comprises that the second time and the first time do not conform to a normal time distribution; based on the matching result, determining whether the to-be-identified page is a cheating page; and in response to determining that the time attribute is a dynamic time, determining the to-be-identified page as a cheating page. 2.The method of claim 1, further comprising: obtaining a third time, wherein the third time is a time point when the to-be-identified page is discovered; and in response to determining that the third time is earlier than the first time, determining the second time corresponding to the to-be-identified page and the time attribute corresponding to the second time. determining the time attribute corresponding to the second time based on a pre-trained model, wherein the model is trained based on feature data related to time information in page source file data.

3. The method of claim 1, wherein, determining a page type of the to-be-identified page, wherein the page type comprises a list page and a content page, and wherein, 4. The method of claim 1, further comprising: the time cheating mode further comprises that a change frequency of the second time is greater than a corresponding preset threshold value associated with the page type. the second time comprises at least two of the page publishing time, the page updating time, and the time corresponding to the content described by the page, and the to-be-identified page comprises a plurality of to-be-identified pages in a same site, 5. The method of claim 1 or 4, wherein, wherein the time cheating mode further comprises that time differences between the second times corresponding to the plurality of to-be-identified pages are approximately equal. the second time comprises at least one of the page publishing time and the page updating time, and the time corresponding to the content described by the page, and wherein, 6. The method of claim 1, wherein, the time cheating mode further comprises that the at least one of the page publishing time and the page updating time is later than the time corresponding to the content described by the page by a preset time period. the preset time cheating mode is multiple, and wherein, based on the matching result, determining whether the to-be-identified page is a cheating page comprises:

7. The method of claim 1, wherein, based on the matched time cheating mode and a respective preset weight value corresponding to each time cheating mode, determining whether the to-be-identified page is a cheating page. ​ 8. An apparatus for page time cheating screening, comprising: a first obtaining unit configured to obtain source file data for generating a to-be-identified page and a first time, wherein the first time is a time point when the source file data is obtained; a first determining unit configured to determine, based on the source file data, a second time corresponding to the to-be-identified page and a time attribute corresponding to the second time, wherein the second time comprises at least one of a page publishing time, a page updating time, and a time corresponding to content described by the page, and the time attribute comprises a dynamic time and a static time, and wherein determining the time attribute corresponding to the second time comprises: obtaining the source file data for generating the to-be-identified page multiple times to determine a corresponding second time after each time the source file data is obtained; and in response to determining that the corresponding second times obtained multiple times are inconsistent, determining the time attribute corresponding to the second time as a dynamic attribute; a matching unit configured to, in response to determining that the time attribute is a static time, match the first time and the second time with a preset time cheating mode, wherein the time cheating mode comprises that the second time and the first time do not conform to a normal time distribution; a second determining unit configured to determine, based on a matching result, whether the to-be-identified page is a cheating page; and a fourth determining unit configured to, in response to determining that the time attribute is a dynamic time, determine the to-be-identified page as a cheating page.

9. The apparatus of claim 8, further comprising: a second obtaining unit configured to obtain a third time, wherein the third time is a time point when the to-be-identified page is discovered; and a third determining unit configured to, in response to determining that the third time is earlier than the first time, determine the second time corresponding to the to-be-identified page and the time attribute corresponding to the second time.

10. The apparatus of claim 8, further comprising a fifth determining unit configured to determine a page type of the to-be-identified page, wherein the page type comprises a list page and a content page, and wherein the time cheating mode further comprises that a change frequency of the second time is greater than a preset threshold value associated with the page type. the second time comprises at least two of the page publishing time, the page updating time, and the time corresponding to the content described by the page, and the to-be-identified page comprises a plurality of to-be-identified pages in a same site, 11. The apparatus of claim 8 or 10, wherein, wherein the time cheating mode further comprises that time differences between the second times corresponding to the plurality of to-be-identified pages are approximately equal. the second time comprises at least one of the page publishing time and the page updating time, and the time corresponding to the content described by the page, and wherein 12. The apparatus of claim 8, wherein, the time cheating mode further comprises that the at least one of the page publishing time and the page updating time is later than the time corresponding to the content described by the page by a preset time period. ​ 13. The apparatus of claim 8, wherein, The preset time cheating manners are multiple, and the second determining unit comprises a unit for determining whether the page to be identified is a cheating page based on the matched time cheating manners and their respective preset weight values.

14. An electronic device, comprising: at least one processor; and a memory connected with the at least one processor in communication; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-7.

15. A non-transitory computer readable storage medium having stored thereon computer instructions, wherein, The computer instructions are used to enable the computer to perform the method according to any one of claims 1-7.

16. A computer program product comprising a computer program, wherein, The computer program, when executed by a processor, implements the method of any one of claims 1-7. The computer program, when executed by a processor, implements the method of any one of claims 1-7.

Citation Information

Patent Citations

  • Data timeliness identification method and device

    CN112199565A