Share This Author
Privacy wizards for social networking sites
A template for the design of a social networking privacy wizard based on an active learning paradigm called uncertainty sampling, which is able to recommend high-accuracy privacy settings using less user input than existing policy-specification tools.
Enhancing text clustering by leveraging Wikipedia semantics
- Jian Hu, Lujun Fang, Zheng Chen
- Computer ScienceAnnual International ACM SIGIR Conference on…
- 20 July 2008
A way to build a concept thesaurus based on the semantic relations (synonym, hypernym, and associative relation) extracted from Wikipedia is proposed and a unified framework to leverage these semantic relations in order to enhance traditional content similarity measure for text clustering is developed.
REX: Explaining Relationships between Entity Pairs
- Lujun Fang, A. Sarma, Cong Yu, P. Bohannon
- Computer ScienceProceedings of the VLDB Endowment
- 1 November 2011
REX is presented, a system that takes a pair of entities in a given knowledge base as input and efficiently identifies a ranked list of relationship explanations, which formally define relationship explanations and analyze their desirable properties.
Finding related tables
This work considers the problem of finding related tables in a large corpus of heterogenous tables and proposes a framework that captures several types of relatedness, including tables that are candidates for joins and tables that is candidates for union.
Maximal planar scale-free Sierpinski networks with small-world effect and power law strength-degree correlation
This paper proposes a type of deterministically growing networks called Sierpinski networks, which are induced by the famous SierPinski fractals and constructed in a simple iterative way, and derives analytical expressions for degree distribution, strength distribution, clustering coefficient, and strength-degree correlation which agree well with the characterizations of various real-life networks.
Look who I found: understanding the effects of sharing curated friend groups
The impact that circle-sharing has had on the growth and structure of the Google+ social network is investigated and features that can be used to predict which of a user's circles (s)he is most likely to share are identified, demonstrating that it is feasible to suggest to a user which circles to share with friends.
A hierarchical composites constructed by ZIF-8 derived carbon core and Mn3O4/N-doped carbon shell as efficient polysulfide entrapment host for Li−S batteries
A privacy recommendation wizard for users of social networking sites
A machine learning privacy wizard, or recommendation tool, that is based on the underlying observation that real users conceive their privacy preferences based on an implicit structure and can be used to recommend detailed privacy settings for the user.
Analytical solution of average path length for Apollonian networks.
- Zhongzhi Zhang, L. Chen, Shuigeng Zhou, Lujun Fang, J. Guan, Tao Zou
- PhysicsPhysical review. E, Statistical, nonlinear, and…
- 24 June 2007
With the help of recursion relations derived from the self-similar structure, the rigorous solution shows that the average path length grows logarithmically as d[over ]_(t) proportional, variantln N_(T) in the infinite limit of network size N_( t) .
Recursive weighted treelike networks
- Zhongzhi Zhang, Shuigeng Zhou, L. Chen, J. Guan, Lujun Fang, Yichao Zhang
- Computer Science
- 23 April 2007
Analytical results indicate that the resulting networks have power-law distributions of degree, strength, weight and betweenness, a scale-free behavior for degree correlations, logarithmic small average path length and diameter with network size.