Designing a Client Application with Information Extraction for Mobile Phone Users

  • Luke Chen
  • Peiqiang Chen
  • Chu Zhao
  • Jianming Ji
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 214)


Pervasive diffusion of mobile phones nowadays attracts numerous research attention of scholars and engineers to providing client applications. This paper is aimed at providing a conceptual design for a client application as a service from home web platforms in consideration of limited screen size and navigability of mobile device. In doing so, the work is centered on the design of the information extraction module by incorporating various ways of extracting entries of interest from the perspectives of relevance, coverage, and redundancy, as well as introducing a combined measure. Moreover, a preliminary prototype is developed to show its applicability in an Android environment.


Client application Mobile phone Information extraction Mobile search 


  1. 1.
    ITU (2011) The world in 2011: ICT facts and figures. ITU Telecom 2011, Geneva, 25–27 October (2011). (
  2. 2.
  3. 3.
    Mobile Search in the US, eMarketer report. Accessed Jan 2010
  4. 4.
    The search wars are going mobile, eMarketer report. Accessed July 2007
  5. 5.
    Mobile Search.
  6. 6.
    Liu B (1998) Web data mining: exploring hyperlinks, contents, and usage data. Springer, BerlinGoogle Scholar
  7. 7.
    Spink A, Jansen BJ (2004) Web search: public searching of the web. Kluwer Academic Publishers, DordrechtGoogle Scholar
  8. 8.
    Singhal A (2001) Modern information retrieval: a brief overview. Bull IEEE Comput Soc Tech Committee Data Eng 24(4):35–43Google Scholar
  9. 9.
    Lee HS (2001) An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix. Fuzzy Sets Syst 123(1):129–136Google Scholar
  10. 10.
    Kandel J, Yelowitz L (1974) Fuzzy chains. IEEE Trans Syst Man Cybern 4:472–475MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Potoczny HB (1984) On similarity relations in fuzzy relational databases. Fuzzy Sets Syst 12(3):231–235CrossRefMATHGoogle Scholar
  12. 12.
    Larsen HK, Yager R (1989) A fast maxmin similarity algorithm. In: Verdegay JC, Delgado M (eds) The interface between AI and OR in a fuzzy environment, IS 95. Verlag TUV Rheinland, Koln, Germany, pp 147–155Google Scholar
  13. 13.
    Fu G (1992) An algorithm for computing the transitive closure of a fuzzy similarity matrix. Fuzzy Sets Syst 51:189–194CrossRefMATHGoogle Scholar
  14. 14.
    Deshpande M, Karypis G (2004) Item-based Top-N recommendation algorithms. ACM Trans Inf Syst 22(1):143–177Google Scholar
  15. 15.
    Langville AN, Meyer CD (2006) Google’s page rank and beyond: the science of search engine rankings. Princeton University Press, New JerseyGoogle Scholar
  16. 16.
    Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the webGoogle Scholar
  17. 17.
    Tan P-N, Steinbach M, Kumar V (2005) Introduction to data mining, Addison-Wesley, Upper Saddle RiverGoogle Scholar
  18. 18.
    Pan F, Wang W, Anthony KHT, Yang J (2005) Finding representative set from massive data. In: The fifth international conference on data mining, pp 338–345Google Scholar
  19. 19.
    Coulter PB (1989) Measuring Inequality. Westview Press, BoulderGoogle Scholar
  20. 20.
    Ma BJ, Wei Q, Chen GQ (2010) A combined measure for representativeness on information retrieval in web search. In: Proceedings of FLINS2010, Chengdu, August 2010Google Scholar
  21. 21.
    Salton G (1983) Extended boolean information retrieval. Commun ACM 26:1022–1036MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Luke Chen
    • 1
  • Peiqiang Chen
    • 1
  • Chu Zhao
    • 1
  • Jianming Ji
    • 1
  1. 1.Department of Computer Science at Century CollegeBeijing University of Posts and TelecommunicationsBeijingPeople’s Republic of China

Personalised recommendations