Iceberg Clique queries in large graphs
This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed quer...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Hao, Fei [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2017transfer abstract |
|---|
| Umfang: |
10 |
|---|
| Übergeordnetes Werk: |
Enthalten in: The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast - Liu, Yang ELSEVIER, 2018, an international journal, Amsterdam |
|---|---|
| Übergeordnetes Werk: |
volume:256 ; year:2017 ; day:20 ; month:09 ; pages:101-110 ; extent:10 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.neucom.2015.12.142 |
|---|
| Katalog-ID: |
ELV035971983 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV035971983 | ||
| 003 | DE-627 | ||
| 005 | 20230625210218.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180603s2017 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.neucom.2015.12.142 |2 doi | |
| 028 | 5 | 2 | |a GBVA2017014000006.pica |
| 035 | |a (DE-627)ELV035971983 | ||
| 035 | |a (ELSEVIER)S0925-2312(17)30408-3 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 610 | |
| 082 | 0 | 4 | |a 610 |q DE-600 |
| 082 | 0 | 4 | |a 570 |q VZ |
| 084 | |a BIODIV |q DE-30 |2 fid | ||
| 084 | |a 35.70 |2 bkl | ||
| 084 | |a 42.12 |2 bkl | ||
| 100 | 1 | |a Hao, Fei |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Iceberg Clique queries in large graphs |
| 264 | 1 | |c 2017transfer abstract | |
| 300 | |a 10 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. | ||
| 520 | |a This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. | ||
| 700 | 1 | |a Pei, Zheng |4 oth | |
| 700 | 1 | |a Park, Doo-Soon |4 oth | |
| 700 | 1 | |a Yang, Laurence T. |4 oth | |
| 700 | 1 | |a Jeong, Young-Sik |4 oth | |
| 700 | 1 | |a Park, Jong-Hyuk |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Liu, Yang ELSEVIER |t The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast |d 2018 |d an international journal |g Amsterdam |w (DE-627)ELV002603926 |
| 773 | 1 | 8 | |g volume:256 |g year:2017 |g day:20 |g month:09 |g pages:101-110 |g extent:10 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.neucom.2015.12.142 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a FID-BIODIV | ||
| 912 | |a SSG-OLC-PHA | ||
| 936 | b | k | |a 35.70 |j Biochemie: Allgemeines |q VZ |
| 936 | b | k | |a 42.12 |j Biophysik |q VZ |
| 951 | |a AR | ||
| 952 | |d 256 |j 2017 |b 20 |c 0920 |h 101-110 |g 10 | ||
| 953 | |2 045F |a 610 | ||
| author_variant |
f h fh |
|---|---|
| matchkey_str |
haofeipeizhengparkdoosoonyanglaurencetje:2017----:cbrciuqeisna |
| hierarchy_sort_str |
2017transfer abstract |
| bklnumber |
35.70 42.12 |
| publishDate |
2017 |
| allfields |
10.1016/j.neucom.2015.12.142 doi GBVA2017014000006.pica (DE-627)ELV035971983 (ELSEVIER)S0925-2312(17)30408-3 DE-627 ger DE-627 rakwb eng 610 610 DE-600 570 VZ BIODIV DE-30 fid 35.70 bkl 42.12 bkl Hao, Fei verfasserin aut Iceberg Clique queries in large graphs 2017transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. Pei, Zheng oth Park, Doo-Soon oth Yang, Laurence T. oth Jeong, Young-Sik oth Park, Jong-Hyuk oth Enthalten in Elsevier Liu, Yang ELSEVIER The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast 2018 an international journal Amsterdam (DE-627)ELV002603926 volume:256 year:2017 day:20 month:09 pages:101-110 extent:10 https://doi.org/10.1016/j.neucom.2015.12.142 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA 35.70 Biochemie: Allgemeines VZ 42.12 Biophysik VZ AR 256 2017 20 0920 101-110 10 045F 610 |
| spelling |
10.1016/j.neucom.2015.12.142 doi GBVA2017014000006.pica (DE-627)ELV035971983 (ELSEVIER)S0925-2312(17)30408-3 DE-627 ger DE-627 rakwb eng 610 610 DE-600 570 VZ BIODIV DE-30 fid 35.70 bkl 42.12 bkl Hao, Fei verfasserin aut Iceberg Clique queries in large graphs 2017transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. Pei, Zheng oth Park, Doo-Soon oth Yang, Laurence T. oth Jeong, Young-Sik oth Park, Jong-Hyuk oth Enthalten in Elsevier Liu, Yang ELSEVIER The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast 2018 an international journal Amsterdam (DE-627)ELV002603926 volume:256 year:2017 day:20 month:09 pages:101-110 extent:10 https://doi.org/10.1016/j.neucom.2015.12.142 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA 35.70 Biochemie: Allgemeines VZ 42.12 Biophysik VZ AR 256 2017 20 0920 101-110 10 045F 610 |
| allfields_unstemmed |
10.1016/j.neucom.2015.12.142 doi GBVA2017014000006.pica (DE-627)ELV035971983 (ELSEVIER)S0925-2312(17)30408-3 DE-627 ger DE-627 rakwb eng 610 610 DE-600 570 VZ BIODIV DE-30 fid 35.70 bkl 42.12 bkl Hao, Fei verfasserin aut Iceberg Clique queries in large graphs 2017transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. Pei, Zheng oth Park, Doo-Soon oth Yang, Laurence T. oth Jeong, Young-Sik oth Park, Jong-Hyuk oth Enthalten in Elsevier Liu, Yang ELSEVIER The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast 2018 an international journal Amsterdam (DE-627)ELV002603926 volume:256 year:2017 day:20 month:09 pages:101-110 extent:10 https://doi.org/10.1016/j.neucom.2015.12.142 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA 35.70 Biochemie: Allgemeines VZ 42.12 Biophysik VZ AR 256 2017 20 0920 101-110 10 045F 610 |
| allfieldsGer |
10.1016/j.neucom.2015.12.142 doi GBVA2017014000006.pica (DE-627)ELV035971983 (ELSEVIER)S0925-2312(17)30408-3 DE-627 ger DE-627 rakwb eng 610 610 DE-600 570 VZ BIODIV DE-30 fid 35.70 bkl 42.12 bkl Hao, Fei verfasserin aut Iceberg Clique queries in large graphs 2017transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. Pei, Zheng oth Park, Doo-Soon oth Yang, Laurence T. oth Jeong, Young-Sik oth Park, Jong-Hyuk oth Enthalten in Elsevier Liu, Yang ELSEVIER The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast 2018 an international journal Amsterdam (DE-627)ELV002603926 volume:256 year:2017 day:20 month:09 pages:101-110 extent:10 https://doi.org/10.1016/j.neucom.2015.12.142 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA 35.70 Biochemie: Allgemeines VZ 42.12 Biophysik VZ AR 256 2017 20 0920 101-110 10 045F 610 |
| allfieldsSound |
10.1016/j.neucom.2015.12.142 doi GBVA2017014000006.pica (DE-627)ELV035971983 (ELSEVIER)S0925-2312(17)30408-3 DE-627 ger DE-627 rakwb eng 610 610 DE-600 570 VZ BIODIV DE-30 fid 35.70 bkl 42.12 bkl Hao, Fei verfasserin aut Iceberg Clique queries in large graphs 2017transfer abstract 10 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. Pei, Zheng oth Park, Doo-Soon oth Yang, Laurence T. oth Jeong, Young-Sik oth Park, Jong-Hyuk oth Enthalten in Elsevier Liu, Yang ELSEVIER The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast 2018 an international journal Amsterdam (DE-627)ELV002603926 volume:256 year:2017 day:20 month:09 pages:101-110 extent:10 https://doi.org/10.1016/j.neucom.2015.12.142 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA 35.70 Biochemie: Allgemeines VZ 42.12 Biophysik VZ AR 256 2017 20 0920 101-110 10 045F 610 |
| language |
English |
| source |
Enthalten in The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast Amsterdam volume:256 year:2017 day:20 month:09 pages:101-110 extent:10 |
| sourceStr |
Enthalten in The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast Amsterdam volume:256 year:2017 day:20 month:09 pages:101-110 extent:10 |
| format_phy_str_mv |
Article |
| bklname |
Biochemie: Allgemeines Biophysik |
| institution |
findex.gbv.de |
| dewey-raw |
610 |
| isfreeaccess_bool |
false |
| container_title |
The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast |
| authorswithroles_txt_mv |
Hao, Fei @@aut@@ Pei, Zheng @@oth@@ Park, Doo-Soon @@oth@@ Yang, Laurence T. @@oth@@ Jeong, Young-Sik @@oth@@ Park, Jong-Hyuk @@oth@@ |
| publishDateDaySort_date |
2017-01-20T00:00:00Z |
| hierarchy_top_id |
ELV002603926 |
| dewey-sort |
3610 |
| id |
ELV035971983 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV035971983</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625210218.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2017 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.neucom.2015.12.142</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2017014000006.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV035971983</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0925-2312(17)30408-3</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">610</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">BIODIV</subfield><subfield code="q">DE-30</subfield><subfield code="2">fid</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">35.70</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">42.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hao, Fei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Iceberg Clique queries in large graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pei, Zheng</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Park, Doo-Soon</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Laurence T.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jeong, Young-Sik</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Park, Jong-Hyuk</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Liu, Yang ELSEVIER</subfield><subfield code="t">The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast</subfield><subfield code="d">2018</subfield><subfield code="d">an international journal</subfield><subfield code="g">Amsterdam</subfield><subfield code="w">(DE-627)ELV002603926</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:256</subfield><subfield code="g">year:2017</subfield><subfield code="g">day:20</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:101-110</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.neucom.2015.12.142</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">FID-BIODIV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">35.70</subfield><subfield code="j">Biochemie: Allgemeines</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">42.12</subfield><subfield code="j">Biophysik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">256</subfield><subfield code="j">2017</subfield><subfield code="b">20</subfield><subfield code="c">0920</subfield><subfield code="h">101-110</subfield><subfield code="g">10</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">610</subfield></datafield></record></collection>
|
| author |
Hao, Fei |
| spellingShingle |
Hao, Fei ddc 610 ddc 570 fid BIODIV bkl 35.70 bkl 42.12 Iceberg Clique queries in large graphs |
| authorStr |
Hao, Fei |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV002603926 |
| format |
electronic Article |
| dewey-ones |
610 - Medicine & health 570 - Life sciences; biology |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
610 610 DE-600 570 VZ BIODIV DE-30 fid 35.70 bkl 42.12 bkl Iceberg Clique queries in large graphs |
| topic |
ddc 610 ddc 570 fid BIODIV bkl 35.70 bkl 42.12 |
| topic_unstemmed |
ddc 610 ddc 570 fid BIODIV bkl 35.70 bkl 42.12 |
| topic_browse |
ddc 610 ddc 570 fid BIODIV bkl 35.70 bkl 42.12 |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
z p zp d s p dsp l t y lt lty y s j ysj j h p jhp |
| hierarchy_parent_title |
The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast |
| hierarchy_parent_id |
ELV002603926 |
| dewey-tens |
610 - Medicine & health 570 - Life sciences; biology |
| hierarchy_top_title |
The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV002603926 |
| title |
Iceberg Clique queries in large graphs |
| ctrlnum |
(DE-627)ELV035971983 (ELSEVIER)S0925-2312(17)30408-3 |
| title_full |
Iceberg Clique queries in large graphs |
| author_sort |
Hao, Fei |
| journal |
The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast |
| journalStr |
The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology 500 - Science |
| recordtype |
marc |
| publishDateSort |
2017 |
| contenttype_str_mv |
zzz |
| container_start_page |
101 |
| author_browse |
Hao, Fei |
| container_volume |
256 |
| physical |
10 |
| class |
610 610 DE-600 570 VZ BIODIV DE-30 fid 35.70 bkl 42.12 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Hao, Fei |
| doi_str_mv |
10.1016/j.neucom.2015.12.142 |
| dewey-full |
610 570 |
| title_sort |
iceberg clique queries in large graphs |
| title_auth |
Iceberg Clique queries in large graphs |
| abstract |
This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. |
| abstractGer |
This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. |
| abstract_unstemmed |
This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U FID-BIODIV SSG-OLC-PHA |
| title_short |
Iceberg Clique queries in large graphs |
| url |
https://doi.org/10.1016/j.neucom.2015.12.142 |
| remote_bool |
true |
| author2 |
Pei, Zheng Park, Doo-Soon Yang, Laurence T. Jeong, Young-Sik Park, Jong-Hyuk |
| author2Str |
Pei, Zheng Park, Doo-Soon Yang, Laurence T. Jeong, Young-Sik Park, Jong-Hyuk |
| ppnlink |
ELV002603926 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth oth |
| doi_str |
10.1016/j.neucom.2015.12.142 |
| up_date |
2024-07-06T18:57:40.357Z |
| _version_ |
1803857177197150208 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV035971983</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230625210218.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">180603s2017 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.neucom.2015.12.142</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBVA2017014000006.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV035971983</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0925-2312(17)30408-3</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">610</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">610</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">570</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">BIODIV</subfield><subfield code="q">DE-30</subfield><subfield code="2">fid</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">35.70</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">42.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hao, Fei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Iceberg Clique queries in large graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold θ, an IC query reports the cliques where the number of vertices exceeds ⌊θ|V|⌋. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds ⌊θ|V|⌋. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pei, Zheng</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Park, Doo-Soon</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Laurence T.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jeong, Young-Sik</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Park, Jong-Hyuk</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Liu, Yang ELSEVIER</subfield><subfield code="t">The TORC1 signaling pathway regulates respiration-induced mitophagy in yeast</subfield><subfield code="d">2018</subfield><subfield code="d">an international journal</subfield><subfield code="g">Amsterdam</subfield><subfield code="w">(DE-627)ELV002603926</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:256</subfield><subfield code="g">year:2017</subfield><subfield code="g">day:20</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:101-110</subfield><subfield code="g">extent:10</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.neucom.2015.12.142</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">FID-BIODIV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">35.70</subfield><subfield code="j">Biochemie: Allgemeines</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">42.12</subfield><subfield code="j">Biophysik</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">256</subfield><subfield code="j">2017</subfield><subfield code="b">20</subfield><subfield code="c">0920</subfield><subfield code="h">101-110</subfield><subfield code="g">10</subfield></datafield><datafield tag="953" ind1=" " ind2=" "><subfield code="2">045F</subfield><subfield code="a">610</subfield></datafield></record></collection>
|
| score |
7.400859 |