Skip to main content
Springer Nature Link
Log in

An Extended Branch and Bound Search Algorithm for Finding Top-N Formal Concepts of Documents

  • Conference paper
  • First Online:
New Frontiers in Artificial Intelligence (JSAI 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4384))

Included in the following conference series:

Abstract

This paper presents a branch and bound search algorithm for finding only top N number of extents of formal concepts w.r.t. their evaluation, where the corresponding intents are under some quality control. The algorithm aims at finding potentially interesting documents of even lower evaluation values that belong to some highly evaluated formal concept. The experimental results show that it can effectively find such documents.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Berry, M.W. (ed.): Survey of Text Mining: Clustering, Classification, and Retrieval. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  2. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web (1999), http://dbpubs.stanford.edu/pub/1999-66

  3. Salton, G., McGill, M.J.: Introduction to modern information retrieval. McGraw-Hill, New York (1983)

    MATH  Google Scholar 

  4. Vakali, A., Pokorný, J., Dalamagas, T.: An Overview of Web Data Clustering Practices. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 597–606. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Google SOAP Search API. http://www.google.com/apis/

  6. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems 24(1), 25–46 (1999)

    Article  Google Scholar 

  7. Tomita, E., Seki, T.: An Efficient Branch and Bound Algorithm for Finding a Maximum Clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 278–289. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Fahle, T.: Simple and Fast: Improving a Branch and Bound Algorithm for Maximum Clique. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 485–498. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Kita, K., Tsuda, K., Shishibori, M.: Information Retrieval Algorithms (in Japanese). Kyoritsu Shuppan, Tokyo (2002)

    Google Scholar 

  10. Hotho, A., Stumme, G.: Conceptual Clustering of Text Clusters. In: Proc. of the Machine Learning Workshop (FGML’02), pp. 37–45 (2002)

    Google Scholar 

  11. Hotho, A., Staab, S., Stumme, G.: Explaining Text Clustering Results Using Semantic Structures. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol. 2838, pp. 22–26. Springer, Heidelberg (2003)

    Google Scholar 

  12. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)

    Book  Google Scholar 

  13. Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: Efficient Mining Algorithm for Frequent/Closed/Maximal Itemsets. In: ICDM 2004, IEEE Computer Society Press, Los Alamitos (2004), http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS//Vol-126/

    Google Scholar 

  14. Haraguchi, M.: Concept Learning Based on Optimal Clique Searches (in Japanese). JSAI SIG-FAI-A202-11, pp. 63–66 (2002)

    Google Scholar 

  15. Haraguchi, M., Okubo, Y.: A Method for Pinpoint Clustering of Web Pages with Pseudo-Clique Search. In: Jantke, K.P., Lunzer, A., Spyratos, N., Tanaka, Y. (eds.) Federation over the Web. LNCS (LNAI), vol. 3847, pp. 59–78. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Kanda, K., Haraguchi, M., Okubo, Y.: Constructing Approximate Informative Basis of Asscoiation Rules. In: Jantke, K.P., Shinohara, A. (eds.) DS 2001. LNCS (LNAI), vol. 2226, pp. 141–154. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Okubo, Y., Haraguchi, M.: Creating Abstract Concepts for Classification by Finding Top-N Maximal Weighted Cliques. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 418–425. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Okubo, Y., Haraguchi, M., Shi, B.: Finding Significant Web Pages with Lower Ranks by Pseudo-Clique Search. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds.) DS 2005. LNCS (LNAI), vol. 3735, pp. 346–353. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science, Graduate School of Information Science and Technology, Hokkaido University, N-14 W-9, Sapporo 060-0814, Japan

    Makoto Haraguchi & Yoshiaki Okubo

Authors
  1. Makoto Haraguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshiaki Okubo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Takashi Washio Ken Satoh Hideaki Takeda Akihiro Inokuchi

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Haraguchi, M., Okubo, Y. (2007). An Extended Branch and Bound Search Algorithm for Finding Top-N Formal Concepts of Documents. In: Washio, T., Satoh, K., Takeda, H., Inokuchi, A. (eds) New Frontiers in Artificial Intelligence. JSAI 2006. Lecture Notes in Computer Science(), vol 4384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69902-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-69902-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69901-9

  • Online ISBN: 978-3-540-69902-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics