{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:58:22Z","timestamp":1781107102422,"version":"3.54.1"},"reference-count":15,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,10,1]]},"abstract":"<p>This article first proposed a Bipartite Request Dependency Graph (BRDG) that describes the object-level interrelationships between user click requests and embedded web object requests. These two kinds of requests are classified from HTTP data by an identification algorithm. The interrelationships between user click requests and embedded web object reflect the web page structural, which contain latent web information. Exploring structural patterns is crucial for many aspects like web security analysis and web information visualization. Accordingly, the article also proposed a novel graph decomposition method called orthogonal nonnegative matrix tri-factorization (tNMF) to the BRDG. Compared to traditional web graph analysis focus on statistical and structural properties of the whole graph, the proposed method is dedicated to mine latent web structural patterns. Decomposition results demonstrate that several interesting structures exist in the BRDG. The article aims at classifying these subgraphs as several structural patterns and shedding light on the causes of these patterns.<\/p>","DOI":"10.4018\/ijdcf.2016100101","type":"journal-article","created":{"date-parts":[[2016,8,17]],"date-time":"2016-08-17T11:25:56Z","timestamp":1471433156000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["Exploration of Web Page Structural Patterns Based on Request Dependency Graph Decomposition"],"prefix":"10.4018","volume":"8","author":[{"given":"Cheng","family":"Fang","sequence":"first","affiliation":[{"name":"Beijing University of Post and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo Ya","family":"Liu","sequence":"additional","affiliation":[{"name":"Beijing University of Post and Telecommunications, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJDCF.2016100101-0","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"IJDCF.2016100101-1","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774260"},{"key":"IJDCF.2016100101-2","doi-asserted-by":"crossref","unstructured":"Domenech, J., Gil, J., Sahuquillo, J., & Pont, A. (2006). DDG: An efficient prefetching algorithm for current web generation. In Hot Topics in Web Systems and Technologies, 2006. HOTWEB'06. 1st IEEE Workshop on (pp. 1-12).","DOI":"10.1109\/HOTWEB.2006.355260"},{"key":"IJDCF.2016100101-3","unstructured":"Donato, D., Leonardi, S., Millozzi, S., & Tsaparas, P. (2005). Mining the inner structure of the Web graph. In WebDB (pp. 145-150)."},{"key":"IJDCF.2016100101-4","unstructured":"Huang, X., & Lai, W. (2003). Identification of clusters in the Web graph based on link topology. In Database Engineering and Applications Symposium, 2003. Proceedings. Seventh International (pp. 123-128)."},{"key":"IJDCF.2016100101-5","unstructured":"ITU-T Std. (2006). Functional requirements and architecture of the NGN, ITUT Recommendation Y.2012. Author."},{"key":"IJDCF.2016100101-6","doi-asserted-by":"crossref","unstructured":"Jiang, N., Cao, J., Jin, Y., Li, L. E., & Zhang, Z. L. (2010). Identifying suspicious activities through dns failure graph analysis. In Network Protocols (ICNP), 2010 18th IEEE International Conference on (pp. 144-153).","DOI":"10.1109\/ICNP.2010.5762763"},{"key":"IJDCF.2016100101-7","doi-asserted-by":"crossref","unstructured":"Jin, Y., Duffield, N., Gerber, A., Haffner, P., Hsu, W. L., Jacobson, G., . . . Zhang, Z. L. (2012). Characterizing data usage patterns in a large cellular network. In Proceedings of the 2012 ACM SIGCOMM workshop on Cellular networks: operations, challenges, and future design (pp. 7-12).","DOI":"10.1145\/2342468.2342471"},{"issue":"1","key":"IJDCF.2016100101-8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/2492101.1555356","article-title":"Unveiling core network-wide communication patterns through application traffic activity graph decomposition.","volume":"37","author":"Y.Jin","year":"2009","journal-title":"Performance Evaluation Review"},{"key":"IJDCF.2016100101-9","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.4544648"},{"key":"IJDCF.2016100101-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2013.12.008"},{"key":"IJDCF.2016100101-11","doi-asserted-by":"crossref","unstructured":"Liu, J., Fang, C., & Ansari, N. (2014b). Identifying user clicks based on dependency graph. In Wireless and Optical Communication Conference (WOCC), 2014 23rd (pp. 1-5).","DOI":"10.1109\/WOCC.2014.6839915"},{"key":"IJDCF.2016100101-12","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2014.6863129"},{"key":"IJDCF.2016100101-13","doi-asserted-by":"publisher","DOI":"10.1145\/235160.235164"},{"key":"IJDCF.2016100101-14","doi-asserted-by":"crossref","unstructured":"Sethu, H., & Yates, A. (2010). Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph. In Social Computing (SocialCom), 2010 IEEE Second International Conference on (pp. 683-686).","DOI":"10.1109\/SocialCom.2010.105"}],"container-title":["International Journal of Digital Crime and Forensics"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=163345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T14:54:52Z","timestamp":1749048892000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJDCF.2016100101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2016,10,1]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijdcf.2016100101","relation":{},"ISSN":["1941-6210","1941-6229"],"issn-type":[{"value":"1941-6210","type":"print"},{"value":"1941-6229","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,1]]}}}