IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v33y2005i1p65-71.html
   My bibliography  Save this article

A novel representation of graph structures in web mining and data analysis

Author

Listed:
  • Blazewicz, Jacek
  • Pesch, Erwin
  • Sterna, Malgorzata

Abstract

The paper presents a new graph representation, the graph matrix, which combines the adjacency matrix with the linked lists allowing for the fastest possible access to different types of information on a graph. This is increasingly important for a high search performance, for instance, for rapidly extracting information from the link structure in a hub and authority graph of the World-Wide-Web. A very recent application for the proposed data structure arises from categorical data clustering defining proximity and similarity of data through their patterns of co-occurrence.

Suggested Citation

  • Blazewicz, Jacek & Pesch, Erwin & Sterna, Malgorzata, 2005. "A novel representation of graph structures in web mining and data analysis," Omega, Elsevier, vol. 33(1), pages 65-71, February.
    • Handle: RePEc:eee:jomega:v:33:y:2005:i:1:p:65-71
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(04)00053-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ulrich Dorndorf & Erwin Pesch, 1994. "Fast Clustering Algorithms," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 141-153, May.
    2. Blazewicz, Jacek & Pesch, Erwin & Sterna, Malgorzata, 2000. "The disjunctive graph machine representation of the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 317-331, December.
    3. Steve Lawrence & C. Lee Giles, 1999. "Accessibility of information on the web," Nature, Nature, vol. 400(6740), pages 107-107, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ballings, Michel & Van den Poel, Dirk & Bogaert, Matthias, 2016. "Social media optimization: Identifying an optimal strategy for increasing network size on Facebook," Omega, Elsevier, vol. 59(PA), pages 15-25.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gandal, Neil, 2001. "The dynamics of competition in the internet search engine market," International Journal of Industrial Organization, Elsevier, vol. 19(7), pages 1103-1117, July.
    2. Jose L. Andrade-Pineda & David Canca & Pedro L. Gonzalez-R & M. Calle, 2020. "Scheduling a dual-resource flexible job shop with makespan and due date-related criteria," Annals of Operations Research, Springer, vol. 291(1), pages 5-35, August.
    3. Coleman, Dan & Dong, Xioapeng & Hardin, Johanna & Rocke, David M. & Woodruff, David L., 1999. "Some computational issues in cluster analysis with no a priori metric," Computational Statistics & Data Analysis, Elsevier, vol. 31(1), pages 1-11, July.
    4. Eric T. Bradlow & David C. Schmittlein, 2000. "The Little Engines That Could: Modeling the Performance of World Wide Web Search Engines," Marketing Science, INFORMS, vol. 19(1), pages 43-62, June.
    5. Judit Bar-Ilan, 2018. "Eugene Garfield on the Web in 2001," Scientometrics, Springer;Akadémiai Kiadó, vol. 114(2), pages 389-399, February.
    6. Judit Bar-Ilan, 2001. "Data collection methods on the Web for infometric purposes — A review and analysis," Scientometrics, Springer;Akadémiai Kiadó, vol. 50(1), pages 7-32, January.
    7. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2017. "Flight gate assignment and recovery strategies with stochastic arrival and departure times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 65-93, January.
    8. Oleksandra Yezerska & Foad Mahdavi Pajouh & Alexander Veremyev & Sergiy Butenko, 2019. "Exact algorithms for the minimum s-club partitioning problem," Annals of Operations Research, Springer, vol. 276(1), pages 267-291, May.
    9. Antal Bosch & Toine Bogers & Maurice Kunder, 2016. "Estimating search engine index size variability: a 9-year longitudinal study," Scientometrics, Springer;Akadémiai Kiadó, vol. 107(2), pages 839-856, May.
    10. Judit Bar-Ilan & Rina Azoulay, 2012. "Map of nonprofit organization websites in Israel," Journal of the Association for Information Science & Technology, Association for Information Science & Technology, vol. 63(6), pages 1142-1167, June.
    11. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    12. Rangaswamy, Arvind & Giles, C. Lee & Seres, Silvija, 2009. "A Strategic Perspective on Search Engines: Thought Candies for Practitioners and Researchers," Journal of Interactive Marketing, Elsevier, vol. 23(1), pages 49-60.
    13. Kurowski, Krzysztof & Pecyna, Tomasz & Slysz, Mateusz & Różycki, Rafał & Waligóra, Grzegorz & Wȩglarz, Jan, 2023. "Application of quantum approximate optimization algorithm to job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 518-528.
    14. Amancio, Diego R. & Oliveira Jr., Osvaldo N. & Costa, Luciano da F., 2012. "Structure–semantics interplay in complex networks and its effects on the predictability of similarity in texts," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(18), pages 4406-4419.
    15. Ah-Pine, Julien, 2022. "Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1069-1078.
    16. García-Gallego Aurora & Georgantzís Nikolaos & Pereira Pedro & Pernías-Cerrillo José C., 2016. "Bias and Size Effects of Price-Comparison Platforms: Theory and Experimental Evidence," Review of Network Economics, De Gruyter, vol. 15(1), pages 1-34, March.
    17. Gao, Yuyang & Liang, Wei & Shi, Yuming & Huang, Qiuling, 2014. "Comparison of directed and weighted co-occurrence networks of six languages," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 579-589.
    18. Liang, Wei & Shi, Yuming & Tse, Chi K. & Liu, Jing & Wang, Yanli & Cui, Xunqiang, 2009. "Comparison of co-occurrence networks of the Chinese and English languages," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(23), pages 4901-4909.
    19. Yi Zhou & Jin-Kao Hao & Adrien Goëffon, 2016. "A three-phased local search approach for the clique partitioning problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 469-491, August.
    20. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2008. "Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem," Transportation Science, INFORMS, vol. 42(3), pages 292-301, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:33:y:2005:i:1:p:65-71. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.